Pages that link to "Item:Q1427587"

The following pages link to Preprocessing and cutting for multiple allocation hub location problems. (Q1427587):

Displaying 36 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)
• Exact approaches for static data segment allocation problem in an information network (Q337667) (← links)
• An \(M/M/c\) queue model for hub covering location problem (Q409968) (← links)
• Allocation strategies in hub networks (Q418055) (← links)
• Multi-period hub network design problems with modular capacities (Q512995) (← links)
• Hub location-allocation in intermodal logistic networks (Q531438) (← links)
• Single-allocation ordered median hub location problems (Q709204) (← links)
• Uncapacitated Euclidean hub location: strengthened formulation, new facets and a relax-and-cut algorithm (Q811891) (← links)
• Multiple allocation hub-and-spoke network design under hub congestion (Q833525) (← links)
• Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique (Q864018) (← links)
• Benders decomposition for the uncapacitated multiple allocation hub location problem (Q941531) (← links)
• The capacitated single-allocation hub location problem revisited: a note on a classical formulation (Q992581) (← links)
• Lagrangean relaxation for the capacitated hub location problem with single assignment (Q1027993) (← links)
• The tree of hubs location problem (Q1039782) (← links)
• A capacitated hub location problem under hose demand uncertainty (Q1651522) (← 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)
• Incremental optimization of hub and spoke network for the spokes' numbers and flow (Q1666325) (← links)
• A multiobjective hub-airport location problem for an airline network design (Q1737476) (← links)
• Efficient metaheuristics to solve the intermodal terminal location problem (Q1761128) (← 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)
• Perspectives on modeling hub location problems (Q2029941) (← links)
• The capacitated directed cycle hub location and routing problem under congestion (Q2030629) (← links)
• A non-triangular hub location problem (Q2191284) (← links)
• Alternate second order conic program reformulations for hub location under stochastic demand and congestion (Q2241568) (← links)
• Formulating and solving splittable capacitated multiple allocation hub location problems (Q2387295) (← 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)
• Hub Location as the Minimization of a Supermodular Set Function (Q2935299) (← links)
• On the Quadratic Programming Approach for Hub Location Problems (Q3638504) (← links)
• Models and Algorithms for Intermodal Transportation and Equipment Selection (Q5176321) (← links)
• Multiple allocation hub location with service level constraints for two shipment classes (Q6112611) (← links)
• An alternative approach to address uncertainty in hub location (Q6176182) (← links)
• Hub location with congestion and time-sensitive demand (Q6565427) (← links)