Reliable single allocation hub location problem under hub breakdowns
From MaRDI portal
Publication:1652650
DOI10.1016/j.cor.2018.04.002zbMath1458.90455OpenAlexW2796271482MaRDI QIDQ1652650
Nicolas Kämmerling, Uwe Clausen, Christoph Buchheim, Borzou Rostami
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2018.04.002
Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)
Related Items
Single Allocation Hub Location with Heterogeneous Economies of Scale, On the \(p\)-hub interdiction problem, Planning and design of intermodal hub networks: a literature review, Machine learning augmented approaches for hub location problems, Oracle-based algorithms for binary two-stage robust optimization, Stochastic single-allocation hub location, Perspectives on modeling hub location problems, Reliable hub-and-spoke systems with multiple capacity levels and flow dependent discount factor
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A compact linearisation of Euclidean single allocation hub location problems
- Reliable facility location design under disruptions
- The impact of hub failure in hub-and-spoke networks: mathematical formulations and solution techniques
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- Heuristics for the p-hub location problem
- A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem
- 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
- A branch and cut algorithm for hub location problems with single assignment
- Network hub location problems: The state of the art
- A Decomposition Approach for Single Allocation Hub Location Problems with Multiple Capacity Levels
- Branch and Price for Large-Scale Capacitated Hub Location Problems with Single Assignment
- Reliable Facility Location Design Under the Risk of Disruptions
- The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Airline network design and hub location problems
