A Branch-and-Cut Algorithm for Submodular Interdiction Games (Q5058006): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Maximizing a class of submodular utility functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bilevel partial interdiction problem with capacitated facilities and demand outsourcing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The budget constrained \(r\)-interdiction median problem with capacity expansion / 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: Computational Difficulties of Bilevel Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-level reformulation of the bilevel Knapsack problem using dynamic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bilevel Knapsack with Interdiction Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Network Interdiction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms / 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: Bilevel optimization. Advances and next challenges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design and analysis of approximation algorithms / 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: Interdiction Games and Monotonicity, with Application to Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum clique interdiction problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for the edge interdiction clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A problem in network interdiction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fractional 0-1 programming and submodularity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest-path network interdiction / rank
 
Normal rank
Property / cites work
 
Property / cites work: The polynomial hierarchy and a simple model for competitive analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3096214 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractable Approximations for Assortment Planning with Product Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Outer approximation and submodular cuts for maximum capture facility location problems with random utilities / 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: Solving the traveling salesman problem with interdiction and fortification / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analysis of approximations for maximizing submodular set functions—I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Monotone Submodular Function Maximization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the maximal covering location problem with heuristic concentration / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact approach for the \(r\)-interdiction covering problem with fortification / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bilevel mixed-integer program for critical infrastructure protection planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact solution approach for the interdiction median problem with fortification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact interdiction models and algorithms for disconnecting networks via node deletions / 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: 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 class of algorithms for mixed-integer bilevel min-max optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved \(x\)-space algorithm for min-max bilevel problems with an application to misinformation spread in social networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization of 0-1 hyperbolic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A probabilistic analysis of the maximal covering location problem / 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: An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions / 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: An exact algorithm for solving the bilevel facility interdiction and fortification problem / rank
 
Normal rank

Revision as of 00:28, 31 July 2024

scientific article; zbMATH DE number 7625894
Language Label Description Also known as
English
A Branch-and-Cut Algorithm for Submodular Interdiction Games
scientific article; zbMATH DE number 7625894

    Statements

    A Branch-and-Cut Algorithm for Submodular Interdiction Games (English)
    0 references
    0 references
    0 references
    1 December 2022
    0 references
    interdiction games
    0 references
    submodular optimization
    0 references
    bilevel optimization
    0 references
    branch-and-cut
    0 references
    0 references

    Identifiers