A Branch-and-Cut Algorithm for Submodular Interdiction Games
From MaRDI portal
Publication:5058006
DOI10.1287/ijoc.2022.1196OpenAlexW3139777523MaRDI QIDQ5058006
Publication date: 1 December 2022
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2103.15788
Related Items (2)
A generic optimization framework for resilient systems ⋮ An exact method for binary fortification games
Cites Work
- Unnamed Item
- A class of algorithms for mixed-integer bilevel min-max optimization
- An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions
- A bilevel partial interdiction problem with capacitated facilities and demand outsourcing
- Maximizing a class of submodular utility functions
- The budget constrained \(r\)-interdiction median problem with capacity expansion
- Design and analysis of approximation algorithms
- A projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs
- An exact approach for the \(r\)-interdiction covering problem with fortification
- Solving the traveling salesman problem with interdiction and fortification
- The maximum clique interdiction problem
- Outer approximation and submodular cuts for maximum capture facility location problems with random utilities
- A probabilistic analysis of the maximal covering location problem
- Deterministic network interdiction
- Global optimization of 0-1 hyperbolic programs
- Exact interdiction models and algorithms for disconnecting networks via node deletions
- One-level reformulation of the bilevel Knapsack problem using dynamic programming
- A branch-and-cut algorithm for the edge interdiction clique problem
- Fractional 0-1 programming and submodularity
- An exact approach for the bilevel knapsack problem with interdiction constraints and extensions
- A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation
- Bilevel optimization. Advances and next challenges
- Improved \(x\)-space algorithm for min-max bilevel problems with an application to misinformation spread in social networks
- An exact algorithm for solving the bilevel facility interdiction and fortification problem
- A survey of network interdiction models and algorithms
- Solving the maximal covering location problem with heuristic concentration
- A bilevel mixed-integer program for critical infrastructure protection planning
- An exact solution approach for the interdiction median problem with fortification
- Stochastic Network Interdiction
- Shortest path network interdiction with asymmetric information
- Robust Monotone Submodular Function Maximization
- Bilevel Knapsack with Interdiction Constraints
- Computational Difficulties of Bilevel Linear Programming
- The polynomial hierarchy and a simple model for competitive analysis
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- An analysis of approximations for maximizing submodular set functions—I
- A problem in network interdiction
- A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs
- A Value-Function-Based Exact Approach for the Bilevel Mixed-Integer Programming Problem
- Shortest-path network interdiction
- Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets
- A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games
- Tractable Approximations for Assortment Planning with Product Costs
- Interdiction Games and Monotonicity, with Application to Knapsack Problems
- Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract)
- Removing Arcs from a Network
- A Backward Sampling Framework for Interdiction Problems with Fortification
This page was built for publication: A Branch-and-Cut Algorithm for Submodular Interdiction Games
