A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games (Q5085997): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: DIMACS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Gurobi / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SSCFLPsolver / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: GitHub / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Knapsack / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1287/ijoc.2021.1085 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3206967017 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multi-terminal maximum-flow network-interdiction problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bilevel fixed charge location model for facilities under imminent attack / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sampling-based exact algorithm for the solution of the minimax diameter clustering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3989989 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest path network interdiction with asymmetric information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critical edges/nodes for the minimum spanning tree problem: complexity and approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact method for the capacitated competitive facility location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of randomization in network interdiction / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Continuous-Time Service Network Design Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Bilevel Model for Toll Optimization on a Multicommodity Transportation Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Joint Design and Pricing on a Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interdicting a Nuclear-Weapons Project / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bilevel Knapsack with Interdiction Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A study of general and security Stackelberg game formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for a bi-level knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The conditional \(p\)-dispersion problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness and approximation for network flow interdiction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bilevel programming: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A scalable exact algorithm for the vertex \(p\)-center problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Network Interdiction / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact approach for the bilevel knapsack problem with interdiction constraints and extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the solution of convex bilevel optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: KKT Reformulation and Necessary Conditions for Optimality in Nonsmooth Bilevel Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the use of intersection cuts for bilevel optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interdiction Games and Monotonicity, with Application to Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved cut-and-solve algorithm for the single-source capacitated facility location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An implicit enumeration algorithm for the hub interdiction median problem with fortification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal interdiction policy for a flow network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non‐zero‐sum nonlinear network path interdiction with an application to inspection in terror networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A problem in network interdiction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network interdiction via a critical disruption path: branch-and-price algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic for BILP problems: the single source capacitated facility location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest-path network interdiction / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Bilevel Optimization Approach for Parameter Learning in Variational Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Bilevel Model of Taxation and Its Application to Optimal Highway Pricing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The most vital edges in the minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4452900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Backward Sampling Framework for Interdiction Problems with Fortification / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Value-Function-Based Exact Approach for the Bilevel Mixed-Integer Programming Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal interdiction of a supply network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bilevel programming in traffic planning: Models, methods and challenge / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Mixed Integer Linear Bilevel Programming Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Minimal Algorithm for the 0-1 Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two extended formulations for cardinality maximum flow network interdiction problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of solution strategies for biobjective shortest path problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Bi-Objective Maximum-Flow Network-Interdiction Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic shortest‐path interdiction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms and bounds for the dynamic assignment interdiction problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of network interdiction models and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for solving a Euclidean maximum flow network interdiction problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A global optimization algorithm for generalized semi-infinite, continuous minimax with coupled constraints and bi-level problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A global optimization approach for the linear two-level program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Removing Arcs from a Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic network interdiction / rank
 
Normal rank
Property / cites work
 
Property / cites work: A projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching interdiction / rank
 
Normal rank

Latest revision as of 13:05, 29 July 2024

scientific article; zbMATH DE number 7551216
Language Label Description Also known as
English
A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games
scientific article; zbMATH DE number 7551216

    Statements

    A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games (English)
    0 references
    0 references
    0 references
    30 June 2022
    0 references
    0 references
    interdiction
    0 references
    Stackelberg games
    0 references
    bilevel optimization
    0 references
    integer programming
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references