A fast algorithm for locating supplying center on a lattice

DOI10.1080/00207169908804774MaRDI QIDQ4243279zbMATH OpenOpenAlexFDO

Authors

Publication date 23 August 1999

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207169908804774

zbMATH Keywords

algorithmcontinued fraction expansionconvex polygonlocation problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25)

Recommendations

• scientific article; zbMATH DE number 1460260
• An Algorithm for the p-Center Problem in the Plane
• Euclidean Distance Location-Allocation Problems with Uniform Demands over Convex Polygons
• The p-Centre Problem-Heuristic and Optimal Algorithms

Cites work

• scientific article; zbMATH DE number 3750146 (Why is no real title available?)
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• scientific article; zbMATH DE number 3401212 (Why is no real title available?)
• On the Complexity of Some Common Geometric Location Problems

This page was built for publication: A fast algorithm for locating supplying center on a lattice

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