Technical Note—Solving Constrained Multi-Facility Location Problems Involving lp Distances Using Convex Programming

DOI10.1287/opre.23.3.581zbMath0311.90043OpenAlexW1980834315MaRDI QIDQ4070998

James G. Morris, Love, Robert F.

Publication date: 1975

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.23.3.581

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Nonlinear programming (90C30) Operations research and management science (90B99)

Related Items (10)

A fast algorithm for the rectilinear distance location problem ⋮ Duality in constrained multi‐facility location models ⋮ A multifacility location problem on median spaces ⋮ Duality for constrained multifacility location problems with mixed norms and applications ⋮ Locational analysis ⋮ Asymptotic behavior of the Weber location problem on the plane ⋮ The minisum location problem on an undirected network with continuous link demands ⋮ Normative location theory: Placement in continuous space ⋮ The convergence of the Weiszfeld algorithm ⋮ A generalization of the rectangular bounding method for continuous location models

This page was built for publication: Technical Note—Solving Constrained Multi-Facility Location Problems Involving l_p Distances Using Convex Programming