Search region contraction of the Weber problem solution on the plane with rectangular forbidden zones
From MaRDI portal
Publication:1930700
Recommendations
- A minimax planar location problem with forbidden zones: its solution algorithm
- Solving Weber problem on plane with minimax criterion and forbidden gaps
- Model building and location problem solving in a plane with forbidden gaps
- An efficient algorithm for facility location in the presence of forbidden regions
- scientific article; zbMATH DE number 3984918
Cites work
- A Cut Approach to the Rectilinear Distance Facility Location Problem
- A minimax planar location problem with forbidden zones: its solution algorithm
- An efficient solution method for Weber problems with barriers based on genetic algorithms
- Constrained location of competitive facilities in the plane
- Effective algorithm for the weber problem with a rectangular metric
- Error bounds for the approximative solution of restricted planar location problems
- Facility location in the presence of forbidden regions. I: Formulation and the case of Euclidean distance with one forbidden circle
- scientific article; zbMATH DE number 52552 (Why is no real title available?)
- Location theory. A unified approach
- Model building and location problem solving in a plane with forbidden gaps
Cited in
(5)- Optimal placement of rectangles on a plane with fixed objects
- A minimax planar location problem with forbidden zones: its solution algorithm
- Solving Weber problem on plane with minimax criterion and forbidden gaps
- scientific article; zbMATH DE number 6451396 (Why is no real title available?)
- Solving a maximin location problem on the plane with given accuracy
This page was built for publication: Search region contraction of the Weber problem solution on the plane with rectangular forbidden zones
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1930700)