Integer programming methods for solving binary interdiction games

DOI10.1016/j.ejor.2022.01.009OpenAlexW4206448263WikidataQ114184373 ScholiaQ114184373MaRDI QIDQ2672065

Jose L. Walteros, Ningji Wei

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

zbMATH Keywords

integer programmingnetwork optimizationinterdictionattacker-defenderpolyhedral analysis

Mathematics Subject Classification ID

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

Related Items (2)

Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations ⋮ An exact method for binary fortification games

Cites Work

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

This page was built for publication: Integer programming methods for solving binary interdiction games