Multiple allocation hub interdiction and protection problems: model formulations and solution approaches
From MaRDI portal
Publication:1754747
Recommendations
- On the \(p\)-hub interdiction problem
- An implicit enumeration algorithm for the hub interdiction median problem with fortification
- Hub interdiction problem variants: models and metaheuristic solution algorithms
- A bilevel mixed-integer program for critical infrastructure protection planning
- A dynamic reformulation heuristic for generalized interdiction problems
Cites work
- A bilevel fixed charge location model for facilities under imminent attack
- A bilevel mixed-integer program for critical infrastructure protection planning
- A bilevel partial interdiction problem with capacitated facilities and demand outsourcing
- A new formulation and Benders decomposition for the multi-period maximal covering facility location problem with server uncertainty
- Adapting polyhedral properties from facility to hub location problems
- An exact algorithm for the modular hub location problem with single assignments
- An exact solution approach for the interdiction median problem with fortification
- An implicit enumeration algorithm for the hub interdiction median problem with fortification
- Analysis of facility protection strategies against an uncertain number of attacks: the stochastic R-interdiction median problem with fortification
- Benders decomposition for large-scale uncapacitated hub location
- Benders decomposition for the uncapacitated multiple allocation hub location problem
- Closest assignment constraints and location models: Properties and structure
- Closest assignment constraints in discrete location problems
- Competitive Location on a Network
- Deterministic network interdiction
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Hub interdiction problem variants: models and metaheuristic solution algorithms
- Hub Location and the p-Hub Median Problem
- Hub-and-spoke network design with congestion
- Integer programming formulations of discrete hub location problems
- Links between linear bilevel and mixed 0-1 programming problems
- Minimizing a stochastic maximum-reliability path
- Most vital links and nodes in weighted networks
- Network hub location problems: The state of the art
- On a bi-level formulation to protect uncapacitated p-median systems with facility recovery time and frequent disruptions
- On a new class of bilevel programming problems and its use for reformulating mixed integer problems
- Optimal interdiction of a supply network
- Optimal Interdiction of Unreactive Markovian Evaders
- Optimal location with equitable loads
- Partitioning procedures for solving mixed-variables programming problems
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- Shortest-path network interdiction
- Solving the \(p\)-hub median problem under intentional disruptions using simulated annealing
- Stochastic network interdiction
- Stochastic uncapacitated hub location
- Survivable network design under optimal and heuristic interdiction scenarios
- The budget constrained r-interdiction median problem with capacity expansion
- The capacitated multiple allocation hub location problem: Formulations and algorithms
- The impact of hub failure in hub-and-spoke networks: mathematical formulations and solution techniques
- The stochastic interdiction median problem with disruption intensity levels
- The tree of hubs location problem
- Tight linear programming relaxations of uncapacitated p-hub median problems
- Two-Person Zero-Sum Games for Network Interdiction
Cited in
(10)- An implicit enumeration algorithm for the hub interdiction median problem with fortification
- Capacitated multi-period maximal covering location problem with server uncertainty
- Perspectives on modeling hub location problems
- The continuous maximum capacity path interdiction problem
- Interdicting facilities in tree networks
- A stochastic programming model with endogenous and exogenous uncertainty for reliable network design under random disruption
- On the \(p\)-hub interdiction problem
- An exact method for trilevel hub location problem with interdiction
- Hub interdiction problem variants: models and metaheuristic solution algorithms
- Meeting economic and social viability goals in regional airline schemes through hub-and-spoke network connectivity
This page was built for publication: Multiple allocation hub interdiction and protection problems: model formulations and solution approaches
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1754747)
