Solving a maximin location problem on the plane with given accuracy
From MaRDI portal
Publication:893922
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
Cites work
- scientific article; zbMATH DE number 4003898 (Why is no real title available?)
- scientific article; zbMATH DE number 4083392 (Why is no real title available?)
- scientific article; zbMATH DE number 52552 (Why is no real title available?)
- scientific article; zbMATH DE number 1253055 (Why is no real title available?)
- A polynomial algorithm for solving the facility location problem on a chain network with identical plant production capacities
- Improved algorithms for placing undesirable facilities
- Locating two obnoxious facilities using the weighted maximin criterion
- Location theory. A unified approach
- Model building and location problem solving in a plane with forbidden gaps
- On the complexity of the local search in the \(p\)-median problem
- 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
Cited in
(4)
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)