Effective algorithm for the weber problem with a rectangular metric

DOI10.1007/BF01070282zbMath0436.90051MaRDI QIDQ3877380

V. A. Trubin

Publication date: 1978

Published in: Cybernetics (Search for Journal in Brave)

zbMATH Keywords

location problempolynomial complexityWeber problemlogisticsrectangular metriceffective algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Nonlinear programming (90C30) Inventory, storage, reservoirs (90B05)

Related Items (9)

An algorithm for finding an approximate solution to the Weber problem on a line with forbidden gaps ⋮ A multifacility location problem on median spaces ⋮ Search region contraction of the Weber problem solution on the plane with rectangular forbidden zones ⋮ Algorithms for location problems based on angular distances ⋮ A fast algorithm for the generalized parametric minimum cut problem and applications ⋮ Unnamed Item ⋮ Complexity results for the \(p\)-median problem with mutual communication ⋮ A faster parametric minimum-cut algorithm ⋮ The least element property of center location on tree networks with applications to distance and precedence constrained problems

Cites Work

• Unnamed Item
• An Efficient Computational Procedure for Solving the Multi-Facility Rectilinear Facilities Location Problem
• A Nonlinear Approximation Method for Solving a Generalized Rectangular Distance Weber Problem

This page was built for publication: Effective algorithm for the weber problem with a rectangular metric