Solving a maximin location problem on the plane with given accuracy
DOI10.1134/S0005117914070042zbMATH Open1325.49049OpenAlexW2021273423MaRDI QIDQ893922FDOQ893922
Authors: A. A. Koval', Gennady Grigorjevich Zabudsky 
Publication date: 23 November 2015
Published in: Automation and Remote Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0005117914070042
Recommendations
- Optimal placement of rectangles on a plane with fixed objects
- A minimax planar location problem with forbidden zones: its solution algorithm
- Model building and location problem solving in a plane with forbidden gaps
- An O\((n \log{}n)\) algorithm for a maxmin location problem
- Solving Weber problem on plane with minimax criterion and forbidden gaps
optimizationinteger programmingoptimal placement problembounded region on a planequasipolynomial combinatorial algorithm
Combinatorial optimization (90C27) Integer programming (90C10) Applications of optimal control and differential games (49N90)
Cites Work
- Location theory. A unified approach
- Title not available (Why is that?)
- Search region contraction of the Weber problem solution on the plane with rectangular forbidden zones
- Model building and location problem solving in a plane with forbidden gaps
- Polynomial algorithms to finite Veber problem for a tree network
- Locating two obnoxious facilities using the weighted maximin criterion
- On the complexity of the local search in the \(p\)-median problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Improved algorithms for placing undesirable facilities
- A polynomial algorithm for solving the facility location problem on a chain network with identical plant production capacities
- Title not available (Why is that?)
Cited In (3)
Uses Software
This page was built for publication: Solving a maximin location problem on the plane with given accuracy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q893922)
