A minimax planar location problem with forbidden zones: its solution algorithm
From MaRDI portal
Recommendations
- 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
- Location of an undesirable facility in a polygonal region with forbidden zones
- Solving Weber problem on plane with minimax criterion and forbidden gaps
- A note on center problems with forbidden polyhedra
Cited in
(11)- A comment on a minmax location problem
- A note on center problems with forbidden polyhedra
- Search region contraction of the Weber problem solution on the plane with rectangular forbidden zones
- Complexity results on planar multifacility location problems with forbidden regions
- A heuristic algorithm for minimax sensor location in the plane
- ISO-cost contours to facility location problems in the presence of circular and polygonal forbidden regions
- Solving Weber problem on plane with minimax criterion and forbidden gaps
- An algorithm for finding an approximate solution to the Weber problem on a line with forbidden gaps
- scientific article; zbMATH DE number 849181 (Why is no real title available?)
- Model building and location problem solving in a plane with forbidden gaps
- Solving a maximin location problem on the plane with given accuracy
This page was built for publication: A minimax planar location problem with forbidden zones: its solution algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1778978)
