On the \(p\)-hub interdiction problem
From MaRDI portal
Publication:2664408
DOI10.1016/j.cor.2020.105056zbMath1458.90463OpenAlexW3046672441MaRDI QIDQ2664408
Thomas Ullmert, Stefan Ruzika, Anita Schöbel
Publication date: 20 April 2021
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2020.105056
Related Items (1)
Uses Software
Cites Work
- Solving the \(p\)-hub median problem under intentional disruptions using simulated annealing
- Recovery-to-optimality: a new two-stage approach to robustness with an application to aperiodic timetabling
- The impact of hub failure in hub-and-spoke networks: mathematical formulations and solution techniques
- Generalized light robustness and the trade-off between robustness and nominal quality
- Hub interdiction problem variants: models and metaheuristic solution algorithms
- A quadratic integer program for the location of interacting hub facilities
- Links between linear bilevel and mixed 0-1 programming problems
- On a new class of bilevel programming problems and its use for reformulating mixed integer problems
- Reliable single allocation hub location problem under hub breakdowns
- An implicit enumeration algorithm for the hub interdiction median problem with fortification
- Multiple allocation hub interdiction and protection problems: model formulations and solution approaches
- Exact methods for the discrete multiple allocation \((r|p)\) hub-centroid problem
- Network hub location problems: The state of the art
- Light Robustness
- Hub network design with single and multiple allocation: A computational study
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
This page was built for publication: On the \(p\)-hub interdiction problem
