Weighted min-max location problems: Polynomially bounded algorithms
From MaRDI portal
Publication:1149372
zbMath0453.90030MaRDI QIDQ1149372
R. Chandrasekaran, J. A. P. Pacca Marcos
Publication date: 1980
Published in: Opsearch (Search for Journal in Brave)
computational complexitylogisticsEuclidean distancesparametric quadratic programmingpolynomially bounded algorithmssquare root operationweighted min-max location problems
Analysis of algorithms and problem complexity (68Q25) Applications of mathematical programming (90C90) Inventory, storage, reservoirs (90B05)
Related Items (4)
Solving general continuous single facility location problems by cutting planes ⋮ The weighted Euclidean 1-center problem ⋮ Unnamed Item ⋮ 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
