Solving a maximin location problem on the plane with given accuracy
From MaRDI portal
Publication:893922
DOI10.1134/S0005117914070042zbMath1325.49049OpenAlexW2021273423MaRDI QIDQ893922
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
optimizationinteger programmingoptimal placement problembounded region on a planequasipolynomial combinatorial algorithm
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (1)
Uses Software
Cites Work
- Model building and location problem solving in a plane with forbidden gaps
- Polynomial algorithms to finite Veber problem for a tree network
- Search region contraction of the Weber problem solution on the plane with rectangular forbidden zones
- Improved algorithms for placing undesirable facilities
- Locating two obnoxious facilities using the weighted maximin criterion
- Location Theory
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Solving a maximin location problem on the plane with given accuracy