A Branch-and-Cut Algorithm for Submodular Interdiction Games
From MaRDI portal
(Redirected from Publication:5058006)
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 Backward Sampling Framework for Interdiction Problems with Fortification
- A bilevel mixed-integer program for critical infrastructure protection planning
- A bilevel partial interdiction problem with capacitated facilities and demand outsourcing
- A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation
- A branch-and-cut algorithm for the edge interdiction clique problem
- A class of algorithms for mixed-integer bilevel min-max optimization
- A new general-purpose algorithm for mixed-integer bilevel linear programs
- A probabilistic analysis of the maximal covering location problem
- A problem in network interdiction
- A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games
- A projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs
- A survey of network interdiction models and algorithms
- A value-function-based exact approach for the bilevel mixed-integer programming problem
- An analysis of approximations for maximizing submodular set functions—I
- An exact algorithm for solving the bilevel facility interdiction and fortification problem
- An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions
- An exact approach for the \(r\)-interdiction covering problem with fortification
- An exact approach for the bilevel knapsack problem with interdiction constraints and extensions
- An exact solution approach for the interdiction median problem with fortification
- Bilevel knapsack with interdiction constraints
- Bilevel optimization. Advances and next challenges
- Computational Difficulties of Bilevel Linear Programming
- Design and analysis of approximation algorithms
- Deterministic network interdiction
- Exact interdiction models and algorithms for disconnecting networks via node deletions
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- Fractional 0-1 programming and submodularity
- Global optimization of 0-1 hyperbolic programs
- scientific article; zbMATH DE number 5968956 (Why is no real title available?)
- Improved x-space algorithm for min-max bilevel problems with an application to misinformation spread in social networks
- Interdiction Games and Monotonicity, with Application to Knapsack Problems
- Maximizing a class of submodular utility functions
- Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract)
- Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets
- One-level reformulation of the bilevel Knapsack problem using dynamic programming
- Outer approximation and submodular cuts for maximum capture facility location problems with random utilities
- Removing Arcs from a Network
- Robust monotone submodular function maximization
- Shortest path network interdiction with asymmetric information
- Shortest-path network interdiction
- Solving the maximal covering location problem with heuristic concentration
- Solving the traveling salesman problem with interdiction and fortification
- Stochastic network interdiction
- The budget constrained r-interdiction median problem with capacity expansion
- The maximum clique interdiction problem
- The polynomial hierarchy and a simple model for competitive analysis
- Tractable approximations for assortment planning with product costs
Cited in
(8)- A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games
- Interdiction Games and Monotonicity, with Application to Knapsack Problems
- A generic optimization framework for resilient systems
- An exact method for binary fortification games
- A branch-and-cut algorithm for submodular interdiction games
- The critical node game
- k-submodular interdiction problems under distributional risk-receptiveness and robustness: application to machine learning
- On supervalid inequalities for binary interdiction games
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)
