Edge downgrades in the maximal covering location problem
From MaRDI portal
Cites work
- A game-theoretic approach for downgrading the 1-median in the plane with Manhattan metric
- A new general-purpose algorithm for mixed-integer bilevel linear programs
- A problem in network interdiction
- A survey of network interdiction models and algorithms
- An exact method for trilevel hub location problem with interdiction
- Benders decomposition for very large scale partial set covering and maximal covering location problems
- Complexity of determining the most vital elements for the p-median and p-center location problems
- Designing robust coverage networks to hedge against worst-case facility losses
- Generalized coverage: new developments in covering location models
- Interdicting facilities in tree networks
- Interdiction Games and Monotonicity, with Application to Knapsack Problems
- Lagrangian and branch-and-cut approaches for upgrading spanning tree problems
- Maximizing the minimum source-sink path subject to a budget constraint
- Maximum shortest path interdiction problem by upgrading edges on trees under weighted l₁ norm
- Minmax regret maximal covering location problems with edge demands
- Multi-period stochastic covering location problems: modeling framework and solution approach
- Multi-type maximal covering location problems: hybridizing discrete and continuous problems
- On the complexity of the upgrading version of the maximal covering location problem
- On the hardness of covering-interdiction problems
- Optimal approaches for upgrading selective obnoxious p-median location problems on tree networks
- Revisiting a game theoretic framework for the robust railway network design against intentional attacks
- Solving the maximal covering location problem with heuristic concentration
- The p-median problem with upgrading of transportation costs and minimum travel time allocation
- The Maximal covering location disruption problem
- Up- and downgrading the 1-center in a network
- Up- and downgrading the Euclidean 1-median problem and knapsack Voronoi diagrams
- Upgrading \(p\)-median problem on a path
- Upgrading edges in the graphical TSP
- Upgrading edges in the maximal covering location problem
- Upgrading nodes in tree-shaped hub location
- Upgrading the 1-center problem with edge length variables on a tree
This page was built for publication: Edge downgrades in the maximal covering location problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6974877)
