Integer programming methods for solving binary interdiction games
From MaRDI portal
Publication:2672065
Recommendations
- Computing equilibria for integer programming games
- scientific article; zbMATH DE number 7235434
- An algorithm for solution of interval games
- A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games
- LINEAR AND INTEGER PROGRAMMING TECHNIQUES FOR COOPERATIVE GAMES
- Algorithms for generalized potential games with mixed-integer variables
- Linear programming technique for solving interval-valued constraint matrix games
- scientific article; zbMATH DE number 4209912
- Interdiction Games and Monotonicity, with Application to Knapsack Problems
Cites work
- A Backward Sampling Framework for Interdiction Problems with Fortification
- A branch-and-cut algorithm for the edge interdiction clique problem
- A note on linearized reformulations for a class of bilevel linear integer problems
- A survey of network interdiction models and algorithms
- A survey on mixed-integer programming techniques in bilevel optimization
- An integer programming framework for critical elements detection in graphs
- Branch and cut algorithms for detecting critical nodes in undirected graphs
- Closing the gap in linear bilevel optimization: a new valid primal-dual inequality
- Complexity of Determining the Most Vital Elements for the 1-median and 1-center Location Problems
- Conflict graphs in solving integer programming problems
- Critical edges/nodes for the minimum spanning tree problem: complexity and approximation
- Detecting critical node structures on graphs: a mathematical programming approach
- Detecting critical nodes in sparse graphs
- Dynamic games in cyber-physical security: an overview
- Edmonds polytopes and a hierarchy of combinatorial problems
- Efficient methods for the distance-based critical node detection problem in complex networks
- Epidemic dynamics on complex networks
- Exact interdiction models and algorithms for disconnecting networks via node deletions
- Infrastructure security games
- Integer Programming Formulations for Minimum Spanning Tree Interdiction
- Interdicting a Nuclear-Weapons Project
- Interdicting nuclear material on cargo containers using knapsack problem models
- Links between linear bilevel and mixed 0-1 programming problems
- Matching interdiction
- Minimum cost edge blocker clique problem
- Minimum edge blocker dominating set problem
- Minimum vertex blocker clique problem
- Modeling \(s-t\) path availability to support disaster vulnerability assessment of network infrastructure
- Non‐zero‐sum nonlinear network path interdiction with an application to inspection in terror networks
- On Linear Time Minor Tests with Depth-First Search
- On the 0,1 facets of the set covering polytope
- On the Karush-Kuhn-Tucker reformulation of the bilevel optimization problem
- On the facial structure of the set covering polytope
- On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\)
- On the set covering polytope. II: Lifting the facets with coefficients in \(\{\) 0,1,2\(\}\)
- On the set covering polytope: Facets with coefficients in \(\{0,1,2,3\}\)
- Optimal interdiction policy for a flow network
- Overcoming human trafficking via operations research and analytics: opportunities for methods, models, and applications
- Securing a border under asymmetric information
- Shortest-path network interdiction
- Stochastic network interdiction
- The critical node detection problem in networks: a survey
- The discipline number of a graph
- The maximum clique interdiction problem
- The most vital nodes with respect to independent set and vertex cover
Cited in
(11)- An exact method for binary fortification games
- A dynamic reformulation heuristic for generalized interdiction problems
- A cutting-plane algorithm for solving a weighted influence interdiction problem
- An optimal algorithm for variable knockout problems
- A branch-and-cut algorithm for submodular interdiction games
- Robust maximum flow network interdiction considering uncertainties in arc capacity and resource consumption
- Shortest path network interdiction with incomplete information: a robust optimization approach
- On the hardness of covering-interdiction problems
- A Branch-and-Cut Algorithm for Submodular Interdiction Games
- Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations
- scientific article; zbMATH DE number 7235434 (Why is no real title available?)
This page was built for publication: Integer programming methods for solving binary interdiction games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2672065)
