A Benders Decomposition for Hub Location Problems Arising in Public Transport
From MaRDI portal
Publication:5391891
DOI10.1007/978-3-540-77903-2_20zbMath1209.90091OpenAlexW2153949552MaRDI QIDQ5391891
Publication date: 7 April 2011
Published in: Operations Research Proceedings (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-77903-2_20
Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20) Discrete location and assignment (90B80)
Related Items (13)
Tight bounds from a path based formulation for the tree of hub location problem ⋮ A capacitated hub location problem in freight logistics multimodal networks ⋮ Robust solution for a min-max regret hub location problem in a fuzzy-stochastic environment ⋮ A biased random-key genetic algorithm for the tree of hubs location problem ⋮ General network design: a unified view of combined location and network design problems ⋮ Multi-period hub location problem considering polynomial time-dependent demand ⋮ Matheuristics for optimizing the network in German wagonload traffic ⋮ Robust solution for a minimax regret hub location problem in a fuzzy-stochastic environment ⋮ Multi-period hub network design problems with modular capacities ⋮ Benders decomposition algorithms for two variants of the single allocation hub location problem ⋮ Flow shipment scheduling in an incomplete hub location-routing network design problem ⋮ A new formulation and an exact approach for the many-to-many hub location-routing problem ⋮ The tree of hubs location problem
Cites Work
This page was built for publication: A Benders Decomposition for Hub Location Problems Arising in Public Transport