Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem
From MaRDI portal
Publication:1342649
DOI10.1016/0377-2217(94)90062-0zbMath0813.90074OpenAlexW2013064914MaRDI QIDQ1342649
Publication date: 12 January 1995
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(94)90062-0
Programming involving graphs or networks (90C35) Integer programming (90C10) Discrete location and assignment (90B80)
Related Items
Multiple allocation hub-and-spoke network design under hub congestion, Robust optimization approach to capacitated single and multiple allocation hub location problems, Multi-product capacitated single-allocation hub location problems: formulations and inequalities, A Lagrangian decomposition approach for the pump scheduling problem in water networks, The hub location and pricing problem, Stochastic hub location problems with Bernoulli demands, Hub location under competition, The Minimum Spanning k-Core Problem with Bounded CVaR Under Probabilistic Edge Failures, Formulating and solving splittable capacitated multiple allocation hub location problems, A multi-modal competitive hub location pricing problem with customer loyalty and elastic demand, Skyport location problem for urban air mobility system, Design of intermodal logistics networks with hub delays, The hub location and routing problem, Hub location problem considering spoke links with incentive-dependent capacities, An \(M/M/c\) queue model for hub covering location problem, Multiple allocation hub location with service level constraints for two shipment classes, Allocation strategies in hub networks, Solving a hub location-routing problem with a queue system under social responsibility by a fuzzy meta-heuristic algorithm, The capacitated \(p\)-hub median problem with integral constraints: an application to a Chinese air cargo network, Trade-offs between the stepwise cost function and its linear approximation for the modular hub location problem, Benders decomposition for the uncapacitated multiple allocation hub location problem, Alternate second order conic program reformulations for hub location under stochastic demand and congestion, Network hub location problems: The state of the art, Capacitated single allocation hub location problem-A bi-criteria approach, Benders decomposition algorithms for two variants of the single allocation hub location problem, Hub-and-spoke network design with congestion, Dual-based approach for a hub network design problem under non-restrictive policy, Solving the uncapacitated hub location problem using genetic algorithms, Facility location models for distribution system design, Alternate solution approaches for competitive hub location problems, Flow shipment scheduling in an incomplete hub location-routing network design problem, HubLocator: An exact solution method for the multiple allocation hub location problem, Stochastic air freight hub location and flight routes planning, Multi-objective hub network design under uncertainty considering congestion: an M/M/c/K queue system, Modeling congestion and service time in hub location problems, On the Quadratic Programming Approach for Hub Location Problems, Lagrangean relaxation for the capacitated hub location problem with single assignment, The tree of hubs location problem, The capacitated multiple allocation hub location problem: Formulations and algorithms, Location of hubs in a competitive environment, Hub Location Problems: The Location of Interacting Facilities, Solving large single allocation \(p\)-hub problems with two or three hubs, Integer programming formulations of discrete hub location problems
Cites Work
- Unnamed Item
- Unnamed Item
- Heuristics for the p-hub location problem
- On ``A quadratic integer program for the location of interacting hub facilities
- A quadratic integer program for the location of interacting hub facilities
- Solving a Freight Transport Problem Using Facility Location Techniques
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- An Algorithm for the Three-Index Assignment Problem
- Interacting New Facilities and Location-Allocation Problems
- Hub Location and the p-Hub Median Problem
- Validation of subgradient optimization
- Networking Policies for Hub-and-Spoke Systems with Application to the Air Transportation System
