A Branch-and-Cut Algorithm for Submodular Interdiction Games
From MaRDI portal
Publication:5058006
DOI10.1287/IJOC.2022.1196OpenAlexW3139777523MaRDI QIDQ5058006FDOQ5058006
Authors: Kübra Tanınmış, Markus Sinnl 
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
Recommendations
- Interdiction Games and Monotonicity, with Application to Knapsack Problems
- Integer programming methods for solving binary interdiction games
- A dynamic reformulation heuristic for generalized interdiction problems
- A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games
- A cutting-plane algorithm for solving a weighted influence interdiction problem
Cites Work
- A bilevel mixed-integer program for critical infrastructure protection planning
- The polynomial hierarchy and a simple model for competitive analysis
- A bilevel partial interdiction problem with capacitated facilities and demand outsourcing
- Deterministic network interdiction
- Exact interdiction models and algorithms for disconnecting networks via node deletions
- Removing Arcs from a Network
- Solving the maximal covering location problem with heuristic concentration
- An analysis of approximations for maximizing submodular set functions—I
- Stochastic network interdiction
- An exact solution approach for the interdiction median problem with fortification
- Computational Difficulties of Bilevel Linear Programming
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- Shortest-path network interdiction
- Shortest path network interdiction with asymmetric information
- One-level reformulation of the bilevel Knapsack problem using dynamic programming
- 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 problem in network interdiction
- The budget constrained \(r\)-interdiction median problem with capacity expansion
- A probabilistic analysis of the maximal covering location problem
- A branch-and-cut algorithm for the edge interdiction clique problem
- Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract)
- Design and analysis of approximation algorithms
- A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation
- Maximizing a class of submodular utility functions
- Global optimization of 0-1 hyperbolic programs
- 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
- A Backward Sampling Framework for Interdiction Problems with Fortification
- Outer approximation and submodular cuts for maximum capture facility location problems with random utilities
- Title not available (Why is that?)
- Robust monotone submodular function maximization
- An exact approach for the \(r\)-interdiction covering problem with fortification
- Solving the traveling salesman problem with interdiction and fortification
- Interdiction Games and Monotonicity, with Application to Knapsack Problems
- The maximum clique interdiction problem
- Bilevel knapsack with interdiction constraints
- An exact approach for the bilevel knapsack problem with interdiction constraints and extensions
- A survey of network interdiction models and algorithms
- Bilevel optimization. Advances and next challenges
- Tractable approximations for assortment planning with product costs
- Fractional 0-1 programming and submodularity
- 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 Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games
- Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets
Cited In (3)
This page was built for publication: A Branch-and-Cut Algorithm for Submodular Interdiction Games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5058006)
