Multiple allocation hub interdiction and protection problems: model formulations and solution approaches
From MaRDI portal
Publication:1754747
DOI10.1016/j.ejor.2018.03.031zbMath1403.90488OpenAlexW2794659965WikidataQ130050899 ScholiaQ130050899MaRDI QIDQ1754747
Navneet Vidyarthi, Ankur Sinha, Prasanna Ramamoorthy, Sachin Jayaswal
Publication date: 31 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://spectrum.library.concordia.ca/983685/1/Ramamoorthy-2018.pdf
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items
Interdicting facilities in tree networks, On the \(p\)-hub interdiction problem, A stochastic programming model with endogenous and exogenous uncertainty for reliable network design under random disruption, Capacitated multi-period maximal covering location problem with server uncertainty, Perspectives on modeling hub location problems, The continuous maximum capacity path interdiction problem
Cites Work
- Solving the \(p\)-hub median problem under intentional disruptions using simulated annealing
- A new formulation and Benders decomposition for the multi-period maximal covering facility location problem with server uncertainty
- A bilevel partial interdiction problem with capacitated facilities and demand outsourcing
- The impact of hub failure in hub-and-spoke networks: mathematical formulations and solution techniques
- Stochastic uncapacitated hub location
- Closest assignment constraints in discrete location problems
- The budget constrained \(r\)-interdiction median problem with capacity expansion
- Adapting polyhedral properties from facility to hub location problems
- Analysis of facility protection strategies against an uncertain number of attacks: the stochastic R-interdiction median problem with fortification
- Hub interdiction problem variants: models and metaheuristic solution algorithms
- Benders decomposition for the uncapacitated multiple allocation hub location problem
- Optimal location with equitable loads
- The tree of hubs location problem
- Partitioning procedures for solving mixed-variables programming problems
- Most vital links and nodes in weighted networks
- Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
- Integer programming formulations of discrete hub location problems
- 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
- The capacitated multiple allocation hub location problem: Formulations and algorithms
- An exact algorithm for the modular hub location problem with single assignments
- An implicit enumeration algorithm for the hub interdiction median problem with fortification
- A bilevel fixed charge location model for facilities under imminent attack
- Hub-and-spoke network design with congestion
- Deterministic network interdiction
- The stochastic interdiction median problem with disruption intensity levels
- Survivable network design under optimal and heuristic interdiction scenarios
- A bilevel mixed-integer program for critical infrastructure protection planning
- An exact solution approach for the interdiction median problem with fortification
- Network hub location problems: The state of the art
- Stochastic Network Interdiction
- On a bi-level formulation to protect uncapacitated p-median systems with facility recovery time and frequent disruptions
- Benders Decomposition for Large-Scale Uncapacitated Hub Location
- Minimizing a stochastic maximum-reliability path
- Optimal Interdiction of Unreactive Markovian Evaders
- Competitive Location on a Network
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Closest assignment constraints and location models: Properties and structure
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- Hub Location and the p-Hub Median Problem
- Shortest-path network interdiction
- Two-Person Zero-Sum Games for Network Interdiction
- Optimal interdiction of a supply network
