The Maximal covering location disruption problem
From MaRDI portal
Discrete location and assignment (90B80) Operations research and management science (90Bxx) Combinatorial optimization (90C27) Minimax problems in mathematical programming (90C47) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) 2-person games (91A05) Games in extensive form (91A18)
Cites work
- A Backward Sampling Framework for Interdiction Problems with Fortification
- A bilevel exposure-oriented sensor location problem for border security
- A bilevel mixed-integer program for critical infrastructure protection planning
- A Branch and Bound Algorithm for the Bilevel Programming Problem
- A class of algorithms for mixed-integer bilevel min-max optimization
- A new general-purpose algorithm for mixed-integer bilevel linear programs
- A problem in network interdiction
- A review of attacker-defender games: current state and paths forward
- A study on the computational complexity of the bilevel knapsack problem
- A survey of network interdiction models and algorithms
- A survey on mixed-integer programming techniques in bilevel optimization
- An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions
- An exact approach for the \(r\)-interdiction covering problem with fortification
- An exact approach for the bilevel knapsack problem with interdiction constraints and extensions
- An overview of bilevel optimization
- Approximating solutions to a bilevel capacitated facility location problem with customer's patronization toward a list of preferences
- Bilevel `defender-attacker' model with multiple attack scenarios
- Bilevel knapsack with interdiction constraints
- Bilevel optimization. Advances and next challenges
- Blockers and transversals
- Competitive Location Models: A Framework and Bibliography
- Complexity theory and cryptology. An introduction to cryptocomplexity.
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Computational Complexity
- Designing robust coverage networks to hedge against worst-case facility losses
- Deterministic network interdiction
- Efficient presolving methods for solving maximal covering and partial set covering location problems
- Exact algorithms for the minimum cost vertex blocker clique problem
- Exact interdiction models and algorithms for disconnecting networks via node deletions
- Finding the n Most Vital Links in Flow Networks
- Finding the n Most Vital Nodes in a Flow Network
- Foundations of bilevel programming
- scientific article; zbMATH DE number 35514 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1252399 (Why is no real title available?)
- Integer programming methods for solving binary interdiction games
- Interdiction Games and Monotonicity, with Application to Knapsack Problems
- Location covering models. History, applications and advancements
- Mathematical Programs with Optimization Problems in the Constraints
- Maximizing the minimum source-sink path subject to a budget constraint
- Metaheuristics for bilevel optimization: a comprehensive review
- Minimum edge blocker dominating set problem
- Minimum vertex blocker clique problem
- Network interdiction to minimize the maximum probability of evasion with synergy between applied resources
- New Branch-and-Bound Rules for Linear Bilevel Programming
- Nodal interdiction
- On locating new facilities in a competitive environment
- On the use of intersection cuts for bilevel optimization
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
- Pyomo -- optimization modeling in Python
- Removing Arcs from a Network
- Sequential competitive location on networks
- Shortest-path network interdiction
- Solution techniques for bi-level knapsack problems
- Solving the bi-objective maximum-flow network-interdiction problem
- The polynomial hierarchy and a simple model for competitive analysis
This page was built for publication: The Maximal covering location disruption problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6979427)
