Search region contraction of the Weber problem solution on the plane with rectangular forbidden zones

DOI10.1134/S0005117912050062zbMath1255.49068OpenAlexW1963938177MaRDI QIDQ1930700

I. V. Amzin, Gennady Grigorjevich Zabudsky

Publication date: 11 January 2013

Published in: Automation and Remote Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0005117912050062

zbMATH Keywords

Weber problemrectangular forbidden zonessearch region contraction

Mathematics Subject Classification ID

Linear programming (90C05) Applications of optimal control and differential games (49N90) Discrete-time control/observation systems (93C55)

Related Items (3)

Solving Weber problem on plane with minimax criterion and forbidden gaps ⋮ Optimal placement of rectangles on a plane with fixed objects ⋮ Solving a maximin location problem on the plane with given accuracy

Cites Work

• Unnamed Item
• An efficient solution method for Weber problems with barriers based on genetic algorithms
• Model building and location problem solving in a plane with forbidden gaps
• Facility location in the presence of forbidden regions. I: Formulation and the case of Euclidean distance with one forbidden circle
• A minimax planar location problem with forbidden zones: its solution algorithm
• Constrained location of competitive facilities in the plane
• Location Theory
• Effective algorithm for the weber problem with a rectangular metric
• A Cut Approach to the Rectilinear Distance Facility Location Problem
• Error bounds for the approximative solution of restricted planar location problems

This page was built for publication: Search region contraction of the Weber problem solution on the plane with rectangular forbidden zones