Pages that link to "Item:Q2460119"

The following pages link to Survivable network design under optimal and heuristic interdiction scenarios (Q2460119):

Displaying 27 items.

• A bilevel partial interdiction problem with capacitated facilities and demand outsourcing (Q336824) (← links)
• Applying ranking and selection procedures to long-term mitigation for improved network restoration (Q339947) (← links)
• Analysis of budget for interdiction on multicommodity network flows (Q513161) (← links)
• Analysis of facility protection strategies against an uncertain number of attacks: the stochastic R-interdiction median problem with fortification (Q709153) (← links)
• The multi-terminal maximum-flow network-interdiction problem (Q713097) (← links)
• The \(q\)-ad hoc hub location problem for multi-modal networks (Q1642959) (← links)
• Solving the traveling salesman problem with interdiction and fortification (Q1728213) (← links)
• Multiple allocation hub interdiction and protection problems: model formulations and solution approaches (Q1754747) (← links)
• Exact interdiction models and algorithms for disconnecting networks via node deletions (Q1926497) (← links)
• Network interdiction with asymmetric cost uncertainty (Q2242212) (← links)
• Convex hull representation of the deterministic bipartite network interdiction problem (Q2248756) (← links)
• On the chance-constrained minimum spanning \(k\)-core problem (Q2274857) (← links)
• A survey of network interdiction models and algorithms (Q2294622) (← links)
• A bi-level model and solution methods for partial interdiction problem on capacitated hierarchical facilities (Q2337397) (← links)
• An iterative security game for computing robust and adaptive network flows (Q2669664) (← links)
• A Brief Overview of Interdiction and Robust Optimization (Q3299227) (← links)
• New product introduction against a predator: A bilevel mixed-integer programming approach (Q3655566) (← links)
• Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs (Q4648696) (← links)
• Multilevel Approaches for the Critical Node Problem (Q4994170) (← links)
• Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets (Q5084616) (← links)
• On Bilevel Optimization with Inexact Follower (Q5120277) (← links)
• Mixed integer bilevel optimization with a \(k\)-optimal follower: a hierarchy of bounds (Q6102856) (← links)
• The multilevel facility location and pricing problems: the computational complexity and the stability analysis (Q6110625) (← links)
• Robust flows with adaptive mitigation (Q6114899) (← links)
• Design of survivable wireless backhaul networks with reliability considerations (Q6164320) (← links)
• An exact method for binary fortification games (Q6167322) (← links)
• A two‐stage network interdiction‐monitoring game (Q6179685) (← links)