Survivable network design under optimal and heuristic interdiction scenarios

DOI10.1007/S10898-006-9067-3zbMATH Open1179.90056OpenAlexW2107022409MaRDI QIDQ2460119FDOQ2460119

Authors: J. Cole Smith, Churlzu Lim, Fransisca Sudargho 

Publication date: 14 November 2007

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-006-9067-3

Recommendations

• Algorithms for network interdiction and fortification games
• Optimal design and defense of networks under link attacks
• Network design and defence
• Protection of flows under targeted attacks
• Reformulation and sampling to solve a stochastic network interdiction problem

zbMATH Keywords

Integer programmingGame theoryNetwork designNetwork interdiction

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Integer programming (90C10)

Cites Work

• Practical bilevel optimization. Algorithms and applications
• Bilevel and multilevel programming: A bibliography review
• A Representation and Economic Interpretation of a Two-Level Programming Problem
• Mathematical Programs with Optimization Problems in the Constraints
• Deterministic network interdiction
• Removing Arcs from a Network
• Stochastic network interdiction
• Networks synthesis and optimum network design problems: Models, solution methods and applications
• Shortest-path network interdiction
• Maximizing the minimum source-sink path subject to a budget constraint
• Two-Level Linear Programming
• Bilevel programming: a survey
• An Algorithm for Solving the General Bilevel Programming Problem
• A bootstrap heuristic for designing minimum cost survivable networks
• Survivable capacitated network design problem: new formulation and Lagrangean relaxation
• On design of a survivable network architecture for dynamic routing: Optimal solution strategy and an efficient heuristic
• Design of communication networks with survivability constraints
• Constraint generation for network reliability problems
• Hierarchical Decomposition in Linear Economic Models

Cited In (34)

• Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs
• Solving the traveling salesman problem with interdiction and fortification
• Design of survivable wireless backhaul networks with reliability considerations
• Multilevel Approaches for the Critical Node Problem
• A bilevel partial interdiction problem with capacitated facilities and demand outsourcing
• Heuristics for multi-stage interdiction of stochastic networks
• Analysis of facility protection strategies against an uncertain number of attacks: the stochastic R-interdiction median problem with fortification
• A bi-level model and solution methods for partial interdiction problem on capacitated hierarchical facilities
• A Brief Overview of Interdiction and Robust Optimization
• The multi-terminal maximum-flow network-interdiction problem
• Multiple allocation hub interdiction and protection problems: model formulations and solution approaches
• An exact method for binary fortification games
• Convex hull representation of the deterministic bipartite network interdiction problem
• The \(q\)-ad hoc hub location problem for multi-modal networks
• Non‐zero‐sum nonlinear network path interdiction with an application to inspection in terror networks
• Online and Stochastic Survivable Network Design
• Mixed integer bilevel optimization with a \(k\)-optimal follower: a hierarchy of bounds
• A survey of network interdiction models and algorithms
• Exact interdiction models and algorithms for disconnecting networks via node deletions
• The multilevel facility location and pricing problems: the computational complexity and the stability analysis
• An iterative security game for computing robust and adaptive network flows
• Survivable network design with demand uncertainty
• Applying ranking and selection procedures to long-term mitigation for improved network restoration
• On the chance-constrained minimum spanning \(k\)-core problem
• Monte Carlo tree search for dynamic shortest-path interdiction
• Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets
• A two‐stage network interdiction‐monitoring game
• Analysis of budget for interdiction on multicommodity network flows
• New product introduction against a predator: a bilevel mixed-integer programming approach
• Stochastic survivable network design problems: theory and practice
• Robust flows with adaptive mitigation
• Network interdiction with asymmetric cost uncertainty
• Two-stage nodal network interdiction under decision-dependent uncertainty
• On Bilevel Optimization with Inexact Follower

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)