Integer programming methods for solving binary interdiction games

DOI10.1016/J.EJOR.2022.01.009OpenAlexW4206448263WikidataQ114184373 ScholiaQ114184373MaRDI QIDQ2672065FDOQ2672065

Authors: Ningji Wei, Jose L. Walteros 

Publication date: 8 June 2022

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2022.01.009

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
• Interdiction Games and Monotonicity, with Application to Knapsack Problems

zbMATH Keywords

integer programmingnetwork optimizationattacker-defenderinterdictionpolyhedral analysis

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Integer programming (90C10) Hierarchical games (including Stackelberg games) (91A65)

Cites Work

• Links between linear bilevel and mixed 0-1 programming problems
• Modeling \(s-t\) path availability to support disaster vulnerability assessment of network infrastructure
• Detecting critical nodes in sparse graphs
• Exact interdiction models and algorithms for disconnecting networks via node deletions
• Branch and cut algorithms for detecting critical nodes in undirected graphs
• An integer programming framework for critical elements detection in graphs
• Conflict graphs in solving integer programming problems
• On Linear Time Minor Tests with Depth-First Search
• Stochastic network interdiction
• On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\)
• On the 0,1 facets of the set covering polytope
• On the facial structure of the set covering polytope
• Infrastructure security games
• Interdicting nuclear material on cargo containers using knapsack problem models
• Edmonds polytopes and a hierarchy of combinatorial problems
• Complexity of Determining the Most Vital Elements for the 1-median and 1-center Location Problems
• Minimum edge blocker dominating set problem
• Critical edges/nodes for the minimum spanning tree problem: complexity and approximation
• The most vital nodes with respect to independent set and vertex cover
• Minimum vertex blocker clique problem
• Shortest-path network interdiction
• Optimal interdiction policy for a flow network
• Matching interdiction
• Non‐zero‐sum nonlinear network path interdiction with an application to inspection in terror networks
• The critical node detection problem in networks: a survey
• Efficient methods for the distance-based critical node detection problem in complex networks
• On the Karush-Kuhn-Tucker reformulation of the bilevel optimization problem
• A branch-and-cut algorithm for the edge interdiction clique problem
• Interdicting a Nuclear-Weapons Project
• Securing a border under asymmetric information
• Epidemic dynamics on complex networks
• On the set covering polytope. II: Lifting the facets with coefficients in \(\{\) 0,1,2\(\}\)
• A Backward Sampling Framework for Interdiction Problems with Fortification
• The discipline number of a graph
• Minimum cost edge blocker clique problem
• A note on linearized reformulations for a class of bilevel linear integer problems
• On the set covering polytope: Facets with coefficients in \(\{0,1,2,3\}\)
• Dynamic games in cyber-physical security: an overview
• The maximum clique interdiction problem
• Overcoming human trafficking via operations research and analytics: opportunities for methods, models, and applications
• Detecting critical node structures on graphs: A mathematical programming approach
• A survey of network interdiction models and algorithms
• Closing the gap in linear bilevel optimization: a new valid primal-dual inequality
• A survey on mixed-integer programming techniques in bilevel optimization
• Integer Programming Formulations for Minimum Spanning Tree Interdiction

Cited In (8)

• Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations
• Title not available (Why is that?)
• A branch-and-cut algorithm for submodular interdiction games
• An exact method for binary fortification games
• A cutting-plane algorithm for solving a weighted influence interdiction problem
• An optimal algorithm for variable knockout problems
• Robust maximum flow network interdiction considering uncertainties in arc capacity and resource consumption
• Shortest path network interdiction with incomplete information: a robust optimization approach

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)