Pages that link to "Item:Q818098"

The following pages link to New formulations for the uncapacitated multiple allocation hub location problem (Q818098):

Displaying 32 items.

• Solving the \(p\)-hub median problem under intentional disruptions using simulated annealing (Q264277) (← links)
• Robust optimization approach to capacitated single and multiple allocation hub location problems (Q291363) (← links)
• Multimodal freight transportation planning: a literature review (Q297170) (← links)
• A Stackelberg hub arc location model for a competitive environment (Q337007) (← links)
• When centers can fail: a close second opportunity (Q337641) (← links)
• Allocation strategies in hub networks (Q418055) (← links)
• Stochastic uncapacitated hub location (Q421562) (← links)
• On relaxing the integrality of the allocation variables of the reliability fixed-charge location problem (Q522273) (← links)
• The uncapacitated hub location problem in networks under decentralized management (Q547111) (← links)
• A fuzzy programming approach for dynamic virtual hub location problem (Q693418) (← links)
• Single-allocation ordered median hub location problems (Q709204) (← links)
• Stochastic set packing problem (Q713096) (← links)
• Multiple allocation hub-and-spoke network design under hub congestion (Q833525) (← links)
• Hub location for time definite transportation (Q833526) (← links)
• Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique (Q864018) (← links)
• Uncapacitated single and multiple allocation \(p\)-hub center problems (Q1013401) (← links)
• The tree of hubs location problem (Q1039782) (← links)
• \(p\)-hub median problem for non-complete networks (Q1652628) (← links)
• Matheuristics for optimizing the network in German wagonload traffic (Q1707082) (← links)
• A multiobjective hub-airport location problem for an airline network design (Q1737476) (← links)
• General network design: a unified view of combined location and network design problems (Q1926688) (← links)
• New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem (Q1926700) (← links)
• A non-triangular hub location problem (Q2191284) (← links)
• On carriers collaboration in hub location problems (Q2286966) (← links)
• A competitive hub location and pricing problem (Q2356192) (← 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)
• Multiple allocation tree of hubs location problem for non-complete networks (Q2669573) (← links)
• Adaptive large neighborhood decomposition search algorithm for multi-allocation hub location routing problem (Q2672134) (← links)
• Hub Location as the Minimization of a Supermodular Set Function (Q2935299) (← links)
• The \(p\)-median problem with upgrading of transportation costs and minimum travel time allocation (Q6047913) (← links)
• Multiple allocation hub location with service level constraints for two shipment classes (Q6112611) (← links)