Survivable network design under optimal and heuristic interdiction scenarios
From MaRDI portal
Publication:2460119
Recommendations
Cites work
- A Representation and Economic Interpretation of a Two-Level Programming Problem
- A bootstrap heuristic for designing minimum cost survivable networks
- An Algorithm for Solving the General Bilevel Programming Problem
- Bilevel and multilevel programming: A bibliography review
- Bilevel programming: a survey
- Constraint generation for network reliability problems
- Design of communication networks with survivability constraints
- Deterministic network interdiction
- Hierarchical Decomposition in Linear Economic Models
- Mathematical Programs with Optimization Problems in the Constraints
- Maximizing the minimum source-sink path subject to a budget constraint
- Networks synthesis and optimum network design problems: Models, solution methods and applications
- On design of a survivable network architecture for dynamic routing: Optimal solution strategy and an efficient heuristic
- Practical bilevel optimization. Algorithms and applications
- Removing Arcs from a Network
- Shortest-path network interdiction
- Stochastic network interdiction
- Survivable capacitated network design problem: new formulation and Lagrangean relaxation
- Two-Level Linear Programming
Cited in
(37)- An iterative security game for computing robust and adaptive network flows
- An exact method for binary fortification games
- Design of survivable wireless backhaul networks with reliability considerations
- Exact interdiction models and algorithms for disconnecting networks via node deletions
- On the chance-constrained minimum spanning \(k\)-core problem
- Survivable network design with demand uncertainty
- Stochastic survivable network design problems: theory and practice
- Analysis of facility protection strategies against an uncertain number of attacks: the stochastic R-interdiction median problem with fortification
- Revisiting a game theoretic framework for the robust railway network design against intentional attacks
- A brief overview of interdiction and robust optimization
- Monte Carlo tree search for dynamic shortest-path interdiction
- A two‐stage network interdiction‐monitoring game
- The multilevel facility location and pricing problems: the computational complexity and the stability analysis
- Robust flows with adaptive mitigation
- Two-stage nodal network interdiction under decision-dependent uncertainty
- The \(q\)-ad hoc hub location problem for multi-modal networks
- Multilevel approaches for the critical node problem
- Solving the traveling salesman problem with interdiction and fortification
- Online and Stochastic Survivable Network Design
- Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs
- Convex hull representation of the deterministic bipartite network interdiction problem
- A bilevel partial interdiction problem with capacitated facilities and demand outsourcing
- Mixed integer bilevel optimization with a \(k\)-optimal follower: a hierarchy of bounds
- Heuristics for multi-stage interdiction of stochastic networks
- Planning a defense that minimizes a resource deficit in the worst-case scenario of supply network destruction
- Network interdiction with asymmetric cost uncertainty
- On bilevel optimization with inexact follower
- A survey of network interdiction models and algorithms
- The multi-terminal maximum-flow network-interdiction problem
- A bi-level model and solution methods for partial interdiction problem on capacitated hierarchical facilities
- Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets
- Non‐zero‐sum nonlinear network path interdiction with an application to inspection in terror networks
- Optimal design and defense of networks under link attacks
- Applying ranking and selection procedures to long-term mitigation for improved network restoration
- Analysis of budget for interdiction on multicommodity network flows
- New product introduction against a predator: a bilevel mixed-integer programming approach
- Multiple allocation hub interdiction and protection problems: model formulations and solution approaches
This page was built for publication: Survivable network design under optimal and heuristic interdiction scenarios
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2460119)
