An exact method for trilevel hub location problem with interdiction
From MaRDI portal
Cites work
- A Backward Sampling Framework for Interdiction Problems with Fortification
- 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 brief overview of interdiction and robust optimization
- A capacitated hub location problem under hose demand uncertainty
- A competitive hub location and pricing problem
- A quadratic integer program for the location of interacting hub facilities
- A survey of network interdiction models and algorithms
- Alternate second order conic program reformulations for hub location under stochastic demand and congestion
- Alternate solution approaches for competitive hub location problems
- An exact method for binary fortification games
- An exact solution approach for the interdiction median problem with fortification
- An implicit enumeration algorithm for the hub interdiction median problem with fortification
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- Designing robust coverage networks to hedge against worst-case facility losses
- Deterministic network interdiction
- Dynamic shortest-path interdiction
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Efficient solution approaches for the bi-criteria \(p\)-hub median and dispersion problem
- Efficient solution methods for a general \(r\)-interdiction median problem with fortification
- Hub interdiction problem variants: models and metaheuristic solution algorithms
- Hub-and-spoke network design with congestion
- Integer programming formulations of discrete hub location problems
- Location science
- Minimizing a stochastic maximum-reliability path
- Model formulations for hub covering problems
- Modelling and analysis of hub-and-spoke networks under stochastic demand and congestion
- Most vital links and nodes in weighted networks
- Multiple allocation hub interdiction and protection problems: model formulations and solution approaches
- Multiple allocation hub location with service level constraints for two shipment classes
- Network hub location problems: The state of the art
- Network interdiction with asymmetric cost uncertainty
- On a bi-level formulation to protect uncapacitated p-median systems with facility recovery time and frequent disruptions
- On the single-assignment \(p\)-hub center problem
- Optimal interdiction of a supply network
- Optimal Interdiction of Unreactive Markovian Evaders
- Perspectives on modeling hub location problems
- Shortest path interdiction problem with arc improvement recourse: A multiobjective approach
- Shortest-path network interdiction
- Solving the hub location problem in a star–star network
- 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 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
- Uncapacitated single and multiple allocation \(p\)-hub center problems
Cited in
(3)
This page was built for publication: An exact method for trilevel hub location problem with interdiction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6982566)
