Pages that link to "Item:Q3418120"

The following pages link to A hub covering model for cargo delivery systems (Q3418120):

Displaying 45 items.

• Metaheuristic applications on discrete facility location problems: a survey (Q260627) (← links)
• Hub location under competition (Q322435) (← links)
• Route planning for a mixed delivery system in long distance transportation and comparison with pure delivery systems (Q491079) (← links)
• Multi-period hub network design problems with modular capacities (Q512995) (← links)
• Hub and spoke network design with single-assignment, capacity decisions and balancing requirements (Q651672) (← links)
• Single-allocation ordered median hub location problems (Q709204) (← links)
• Hub interdiction problem variants: models and metaheuristic solution algorithms (Q723928) (← links)
• Flow shipment scheduling in an incomplete hub location-routing network design problem (Q725702) (← links)
• Modeling fuzzy capacitated p-hub center problem and a genetic algorithm solution (Q727374) (← links)
• A tabu-search based heuristic for the hub covering problem over incomplete hub networks (Q833521) (← links)
• Multiple allocation hub-and-spoke network design under hub congestion (Q833525) (← links)
• Hub location for time definite transportation (Q833526) (← links)
• The capacitated single-allocation hub location problem revisited: a note on a classical formulation (Q992581) (← links)
• Routing and scheduling decisions in the hierarchical hub location problem (Q1652350) (← links)
• Efficient simulated annealing based solution approaches to the competitive single and multiple allocation hub location problems (Q1652521) (← links)
• An efficient matheuristic for the robust multiple allocation \(p\)-hub median problem under polyhedral demand uncertainty (Q1652700) (← links)
• Trade-offs between the stepwise cost function and its linear approximation for the modular hub location problem (Q1725626) (← links)
• The 2-allocation \(p\)-hub median problem and a modified Benders decomposition method for solving hub location problems (Q1725627) (← links)
• An intermodal hub location problem for container distribution in Indonesia (Q1725631) (← links)
• Heuristic algorithms for the single allocation \(p\)-hub center problem with routing considerations (Q1733092) (← links)
• A multiobjective hub-airport location problem for an airline network design (Q1737476) (← links)
• An implicit enumeration algorithm for the hub interdiction median problem with fortification (Q1754202) (← links)
• LTL logistics networks with differentiated services (Q1761236) (← links)
• Design of intermodal logistics networks with hub delays (Q1926780) (← links)
• Benders decomposition algorithms for two variants of the single allocation hub location problem (Q2005805) (← links)
• The hub location problem with market selection (Q2027000) (← links)
• Perspectives on modeling hub location problems (Q2029941) (← links)
• Modeling and solving the uncapacitated \(r\)-allocation \(p\)-hub median problem under congestion (Q2052283) (← links)
• Competitive multiple allocation hub location problem considering primary and backup routes (Q2140777) (← links)
• Benders decomposition applied to profit maximizing hub location problem with incomplete hub network (Q2146970) (← links)
• Stochastic hub location problems with Bernoulli demands (Q2147142) (← links)
• Exact methods for the discrete multiple allocation \((r|p)\) hub-centroid problem (Q2289952) (← links)
• Multi-objective hub network design under uncertainty considering congestion: an M/M/c/K queue system (Q2290577) (← links)
• A bi-objective incomplete hub location-routing problem with flow shipment scheduling (Q2295274) (← links)
• Spatial analysis of single allocation hub location problems (Q2358050) (← links)
• Endogenous effects of hubbing on flow intensities (Q2358055) (← links)
• A specialized branch \& bound \& cut for single-allocation ordered median hub location problems (Q2444555) (← links)
• Network hub location problems: The state of the art (Q2482813) (← links)
• A capacitated hub location problem in freight logistics multimodal networks (Q2629899) (← links)
• Exact algorithms for the robust uncapacitated multiple allocation \(p\)-hub median problem (Q2673530) (← links)
• Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem (Q2691195) (← links)
• Multiobjective multiproduct parcel distribution timetabling: a real-world application (Q2865181) (← links)
• Hub Location Problems: The Location of Interacting Facilities (Q5506727) (← links)
• Parcel Distribution Timetabling Problem with Incomplete Hub Network (Q6160431) (← links)
• A new formulation and branch-and-cut method for single-allocation hub location problems (Q6164619) (← links)