Solving Weber problem on plane with minimax criterion and forbidden gaps

zbMath1335.90061MaRDI QIDQ278537

Natalia Sergeevna Veremchuk, Gennady Grigorjevich Zabudsky

Publication date: 2 May 2016

Published in: Izvestiya Irkutskogo Gosudarstvennogo Universiteta. Seriya Matematika (Search for Journal in Brave)

Full work available at URL: http://isu.ru/journal/downloadArticle?article=_be89d26c3fb54b4bb11e8289fe88b261&lang=rus

zbMATH Keywords

integer programminglocation problemalgorithm branch and boundsforbidden gapsminimax Weber problem

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items (1)

Application of the algorithm for finding the outer median of a graph in the problems of determining the reliability of technical systems

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Model building and location problem solving in a plane with forbidden gaps
• Search region contraction of the Weber problem solution on the plane with rectangular forbidden zones
• A SHORTEST PATH APPROACH TO A MULTIFACILITY MINIMAX LOCATION PROBLEM WITH RECTILINEAR DISTANCES
• A Linear Programming Approach to the Solution of Constrained Multi-Facility Minimax Location Problems where Distances are Rectangular

This page was built for publication: Solving Weber problem on plane with minimax criterion and forbidden gaps