Weighted min-max location problems: Polynomially bounded algorithms

MaRDI QIDQ1149372zbMATH OpenFDO

Authors R. Chandrasekaran, J. A. P. Pacca Marcos

Publication date 1980

Published in Opsearch (Search for Journal in Brave)

zbMATH Keywords

computational complexityEuclidean distanceslogisticsparametric quadratic programmingpolynomially bounded algorithmssquare root operationweighted min-max location problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Inventory, storage, reservoirs (90B05) Applications of mathematical programming (90C90)

Cited in

(4)

• Solving general continuous single facility location problems by cutting planes
• The weighted Euclidean 1-center problem
• scientific article; zbMATH DE number 232497 (Why is no real title available?)
• A recursive algorithm for finding the minimum covering sphere of a polytope and the minimum covering concentric spheres of several polytopes

This page was built for publication: Weighted min-max location problems: Polynomially bounded algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1149372)