On supervalid inequalities for binary interdiction games

DOI10.1007/S10107-024-02111-1MaRDI QIDQ6962856zbMATH OpenFDO

Authors Ningji Wei, Jose L. Walteros

Publication date 8 July 2025

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10107-024-02111-1

zbMATH Keywords

integer programmingcutting planesnetwork interdictiongreedoids

Mathematics Subject Classification ID

Mixed integer programming (90C11) Hierarchical games (including Stackelberg games) (91A65) Algorithmic game theory and complexity (91A68)

Cites work

• scientific article; zbMATH DE number 795222 (Why is no real title available?)
• scientific article; zbMATH DE number 871953 (Why is no real title available?)
• scientific article; zbMATH DE number 1416629 (Why is no real title available?)
• A Backward Sampling Framework for Interdiction Problems with Fortification
• A Branch-and-Cut Algorithm for Submodular Interdiction Games
• A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games
• A Simple Parallel Algorithm for the Maximal Independent Set Problem
• A branch-and-cut algorithm for the edge interdiction clique problem
• A simple min-cut algorithm
• A survey of network interdiction models and algorithms
• A survey on mixed-integer programming techniques in bilevel optimization
• An enhanced branch-and-bound algorithm for bilevel integer linear programming
• An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions
• Bilevel knapsack with interdiction constraints
• Bilevel optimization. Advances and next challenges
• Branch and cut algorithms for detecting critical nodes in undirected graphs
• Cooperative games on antimatroids
• Critical edges/nodes for the minimum spanning tree problem: complexity and approximation
• Deception tactics for network interdiction: a multiobjective approach
• Detecting critical nodes in sparse graphs
• Deterministic network interdiction
• Dynamic shortest-path interdiction
• Epidemic dynamics on complex networks
• Finding the most vital arcs in a network
• Generalized Semi-Markov Processes: Antimatroid Structure and Second-Order Properties
• Graph minors. I. Excluding a forest
• Integer Programming Formulations for Minimum Spanning Tree Interdiction
• Integer programming formulations for the elementary shortest path problem
• Integer programming methods for solving binary interdiction games
• Interdiction Games and Monotonicity, with Application to Knapsack Problems
• Introduction to Greedoids
• Matching interdiction
• Matroids and Graphs
• Matroids on partially ordered sets
• 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
• Multi-Terminal Network Flows
• Multilevel approaches for the critical node problem
• Non‐zero‐sum nonlinear network path interdiction with an application to inspection in terror networks
• Optimal assignments in an ordered set: An application of matroid theory
• Optimal interdiction of a supply network
• Optimal interdiction policy for a flow network
• Sequential Shortest Path Interdiction with Incomplete Information
• Sequential Shortest Path Interdiction with Incomplete Information and Limited Feedback
• Shortest-path network interdiction
• Stochastic network interdiction
• The maximum clique interdiction problem
• The most vital nodes with respect to independent set and vertex cover
• Topology of series-parallel networks
• Two-Person Zero-Sum Games for Network Interdiction

This page was built for publication: On supervalid inequalities for binary interdiction games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6962856)