A polynomial time dual algorithm for the Euclidean multifacility location problem

DOI10.1016/0167-6377(95)00050-XzbMath0856.90067OpenAlexW2003428163MaRDI QIDQ1919190

J. Ben Rosen, Panos M. Pardalos, Guoliang Xue

Publication date: 23 February 1997

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

Full work available at URL: https://doi.org/10.1016/0167-6377(95)00050-x

zbMATH Keywords

duality gappolynomial time algorithminterior point methodsself-concordant barrierEuclidean multifacility location

Mathematics Subject Classification ID

Convex programming (90C25) Abstract computational complexity for mathematical programming problems (90C60) Continuous location (90B85)

Related Items (6)

Robust solutions to multi-facility Weber location problem under interval and ellipsoidal uncertainty ⋮ Two unconstrained optimization approaches for the Euclidean \(\kappa \)-centrum location problem ⋮ On solving the planar \(k\)-centrum problem with Euclidean distances ⋮ A continuation approach for the capacitated multi-facility weber problem based on nonlinear SOCP reformulation ⋮ Conditional facility location problems with continuous demand and a polygonal barrier ⋮ Heuristic solution of the multisource Weber problem as a \(p\)-median problem

Cites Work

• On the convergence of the method of analytic centers when applied to convex quadratic programs
• A method of Analytic Centers for Quadratically Constrained Convex Quadratic Programs
• Properties of a multifacility location problem involving euclidian distances
• Unnamed Item
• Unnamed Item

This page was built for publication: A polynomial time dual algorithm for the Euclidean multifacility location problem