Multi-product capacitated single-allocation hub location problems: formulations and inequalities
From MaRDI portal
Publication:301056
DOI10.1007/s11067-013-9197-3zbMath1339.90194OpenAlexW1999069543MaRDI QIDQ301056
Stefan Nickel, Francisco Saldanha-Da-gama, Isabel H. Correia
Publication date: 29 June 2016
Published in: Networks and Spatial Economics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11067-013-9197-3
Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Discrete location and assignment (90B80)
Related Items (10)
Hub location problems with price sensitive demands ⋮ Sustainability SI: multimode multicommodity network design model for intermodal freight transportation with transfer and emission costs ⋮ Supply chain network designs developed for deteriorating items under conditions of trade credit and partial backordering ⋮ Spatial analysis of single allocation hub location problems ⋮ Endogenous effects of hubbing on flow intensities ⋮ A reliable budget-constrained FL/ND problem with unreliable facilities ⋮ Heuristic algorithms for solving an integrated dynamic center facility location -- network design model ⋮ An exact algorithm for the modular hub location problem with single assignments ⋮ A capacitated biobjective location problem with uniformly distributed demands in the UAV‐supported delivery operation ⋮ Integrated hub location and flow processing schedule problem under renewable capacity constraint
Cites Work
- Unnamed Item
- Unnamed Item
- A tabu-search based heuristic for the hub covering problem over incomplete hub networks
- Tight bounds from a path based formulation for the tree of hub location problem
- Routing traffic at hub facilities
- The capacitated single-allocation hub location problem revisited: a note on a classical formulation
- Lagrangean relaxation for the capacitated hub location problem with single assignment
- The tree of hubs location problem
- Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
- Solution algorithms for the capacitated single allocation hub location problem
- Integer programming formulations of discrete hub location problems
- Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem
- A branch and cut algorithm for hub location problems with single assignment
- Solving the hub location problem with modular link capacities
- Network hub location problems: The state of the art
- Capacitated single allocation hub location problem-A bi-criteria approach
- Branch and Price for Large-Scale Capacitated Hub Location Problems with Single Assignment
- A hub covering network design problem for cargo applications in Turkey
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Networking Policies for Hub-and-Spoke Systems with Application to the Air Transportation System
This page was built for publication: Multi-product capacitated single-allocation hub location problems: formulations and inequalities
