Formulating and solving splittable capacitated multiple allocation hub location problems
From MaRDI portal
Publication:2387295
DOI10.1016/j.cor.2004.04.008zbMath1146.90458OpenAlexW2026135007MaRDI QIDQ2387295
Publication date: 2 September 2005
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2004.04.008
Related Items (21)
Multiple allocation hub-and-spoke network design under hub congestion ⋮ Tight bounds from a path based formulation for the tree of hub location problem ⋮ A conditional \(p\)-hub location problem with attraction functions ⋮ Robust optimization approach to capacitated single and multiple allocation hub location problems ⋮ A Lagrangian heuristic for the multicommodity capacitated location problem with balancing requirements ⋮ A capacitated hub location problem under hose demand uncertainty ⋮ Incremental optimization of hub and spoke network for the spokes' numbers and flow ⋮ General network design: a unified view of combined location and network design problems ⋮ An \(M/M/c\) queue model for hub covering location problem ⋮ Multiple allocation hub location with service level constraints for two shipment classes ⋮ A specialized branch \& bound \& cut for single-allocation ordered median hub location problems ⋮ Optimization of hybrid hub-and-spoke network operation for less-than-truckload freight transportation considering incremental quantity discount ⋮ Alternate second order conic program reformulations for hub location under stochastic demand and congestion ⋮ Proprietor and customer costs in the incomplete hub location-routing network topology ⋮ A fuzzy programming approach for dynamic virtual hub location problem ⋮ Efficient metaheuristics to solve the intermodal terminal location problem ⋮ Network hub location problems: The state of the art ⋮ Single-allocation ordered median hub location problems ⋮ A Benders decomposition approach for a distribution network design problem with consolidation and capacity considerations ⋮ Lagrangean relaxation for the capacitated hub location problem with single assignment ⋮ The tree of hubs location problem
Cites Work
- Unnamed Item
- A quadratic integer program for the location of interacting hub facilities
- Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
- Solution algorithms for the capacitated single allocation hub location problem
- Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
- Integer programming formulations of discrete hub location problems
- Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem
- Preprocessing and cutting for multiple allocation hub location problems.
- The capacitated multiple allocation hub location problem: Formulations and algorithms
This page was built for publication: Formulating and solving splittable capacitated multiple allocation hub location problems
