Pages that link to "Item:Q1342649"

The following pages link to Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem (Q1342649):

Displaying 39 items.

• Robust optimization approach to capacitated single and multiple allocation hub location problems (Q291363) (← links)
• Multi-product capacitated single-allocation hub location problems: formulations and inequalities (Q301056) (← links)
• Hub location under competition (Q322435) (← links)
• An \(M/M/c\) queue model for hub covering location problem (Q409968) (← links)
• Allocation strategies in hub networks (Q418055) (← links)
• The capacitated \(p\)-hub median problem with integral constraints: an application to a Chinese air cargo network (Q450150) (← links)
• Solving the uncapacitated hub location problem using genetic algorithms (Q707014) (← links)
• Facility location models for distribution system design (Q707128) (← links)
• Flow shipment scheduling in an incomplete hub location-routing network design problem (Q725702) (← links)
• Stochastic air freight hub location and flight routes planning (Q733484) (← links)
• Multiple allocation hub-and-spoke network design under hub congestion (Q833525) (← links)
• Benders decomposition for the uncapacitated multiple allocation hub location problem (Q941531) (← links)
• Lagrangean relaxation for the capacitated hub location problem with single assignment (Q1027993) (← links)
• The tree of hubs location problem (Q1039782) (← links)
• Location of hubs in a competitive environment (Q1296365) (← links)
• Integer programming formulations of discrete hub location problems (Q1317166) (← links)
• The hub location and routing problem (Q1388939) (← links)
• The capacitated multiple allocation hub location problem: Formulations and algorithms (Q1579501) (← links)
• Solving large single allocation \(p\)-hub problems with two or three hubs (Q1595449) (← links)
• Trade-offs between the stepwise cost function and its linear approximation for the modular hub location problem (Q1725626) (← links)
• Hub-and-spoke network design with congestion (Q1764770) (← 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)
• Alternate solution approaches for competitive hub location problems (Q2029306) (← links)
• The hub location and pricing problem (Q2140288) (← links)
• Stochastic hub location problems with Bernoulli demands (Q2147142) (← links)
• Alternate second order conic program reformulations for hub location under stochastic demand and congestion (Q2241568) (← links)
• Multi-objective hub network design under uncertainty considering congestion: an M/M/c/K queue system (Q2290577) (← links)
• Modeling congestion and service time in hub location problems (Q2295119) (← links)
• Formulating and solving splittable capacitated multiple allocation hub location problems (Q2387295) (← links)
• Network hub location problems: The state of the art (Q2482813) (← links)
• Capacitated single allocation hub location problem-A bi-criteria approach (Q2483516) (← links)
• A Lagrangian decomposition approach for the pump scheduling problem in water networks (Q2629691) (← links)
• A multi-modal competitive hub location pricing problem with customer loyalty and elastic demand (Q2664382) (← links)
• Skyport location problem for urban air mobility system (Q2669717) (← links)
• Hub location problem considering spoke links with incentive-dependent capacities (Q2676359) (← links)
• The Minimum Spanning <i>k</i>-Core Problem with Bounded CVaR Under Probabilistic Edge Failures (Q3186660) (← links)
• Multiple allocation hub location with service level constraints for two shipment classes (Q6112611) (← links)
• Solving a hub location-routing problem with a queue system under social responsibility by a fuzzy meta-heuristic algorithm (Q6170664) (← links)