A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games
From MaRDI portal
Publication:5085997
DOI10.1287/IJOC.2021.1085OpenAlexW3206967017MaRDI QIDQ5085997FDOQ5085997
Authors: Claudio Contardo, Jorge A. Sefair 
Publication date: 30 June 2022
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2021.1085
Recommendations
- Integer programming methods for solving binary interdiction games
- Interdiction Games and Monotonicity, with Application to Knapsack Problems
- A dynamic reformulation heuristic for generalized interdiction problems
- A Branch-and-Cut Algorithm for Submodular Interdiction Games
- Exact algorithms and bounds for the dynamic assignment interdiction problem
Cites Work
- An improved cut-and-solve algorithm for the single-source capacitated facility location problem
- Title not available (Why is that?)
- Bilevel programming in traffic planning: Models, methods and challenge
- A bilevel optimization approach for parameter learning in variational models
- A bilevel fixed charge location model for facilities under imminent attack
- On the solution of convex bilevel optimization problems
- A global optimization algorithm for generalized semi-infinite, continuous minimax with coupled constraints and bi-level problems
- Deterministic network interdiction
- A bilevel model of taxation and its application to optimal highway pricing
- Removing Arcs from a Network
- KKT reformulation and necessary conditions for optimality in nonsmooth bilevel optimization
- Stochastic network interdiction
- A Minimal Algorithm for the 0-1 Knapsack Problem
- A heuristic for BILP problems: the single source capacitated facility location problem
- The Mixed Integer Linear Bilevel Programming Problem
- A comparison of solution strategies for biobjective shortest path problems
- The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability
- Critical edges/nodes for the minimum spanning tree problem: complexity and approximation
- Shortest-path network interdiction
- Optimal interdiction policy for a flow network
- Matching interdiction
- A study of general and security Stackelberg game formulations
- Solving the bi-objective maximum-flow network-interdiction problem
- Shortest path network interdiction with asymmetric information
- Network interdiction via a critical disruption path: branch-and-price algorithms
- A Bilevel Model for Toll Optimization on a Multicommodity Transportation Network
- Non‐zero‐sum nonlinear network path interdiction with an application to inspection in terror networks
- An implicit enumeration algorithm for the hub interdiction median problem with fortification
- Title not available (Why is that?)
- A problem in network interdiction
- Optimal interdiction of a supply network
- Bilevel programming: a survey
- Interdicting a Nuclear-Weapons Project
- Approximation algorithms for a bi-level knapsack problem
- Joint Design and Pricing on a Network
- A global optimization approach for the linear two-level program
- A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation
- Exact algorithms for solving a Euclidean maximum flow network interdiction problem
- The most vital edges in the minimum spanning tree problem
- The Continuous-Time Service Network Design Problem
- A new general-purpose algorithm for mixed-integer bilevel linear programs
- A value-function-based exact approach for the bilevel mixed-integer programming problem
- A projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs
- The multi-terminal maximum-flow network-interdiction problem
- A Backward Sampling Framework for Interdiction Problems with Fortification
- A sampling-based exact algorithm for the solution of the minimax diameter clustering problem
- A scalable exact algorithm for the vertex \(p\)-center problem
- Two extended formulations for cardinality maximum flow network interdiction problem
- Exact method for the capacitated competitive facility location problem
- On the power of randomization in network interdiction
- Interdiction Games and Monotonicity, with Application to Knapsack Problems
- Bilevel knapsack with interdiction constraints
- Hardness and approximation for network flow interdiction
- On the use of intersection cuts for bilevel optimization
- An exact approach for the bilevel knapsack problem with interdiction constraints and extensions
- A survey of network interdiction models and algorithms
- The conditional \(p\)-dispersion problem
- Exact algorithms and bounds for the dynamic assignment interdiction problem
- Dynamic shortest-path interdiction
Cited In (4)
Uses Software
This page was built for publication: A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5085997)
