Euclidean Distance Location-Allocation Problems with Uniform Demands over Convex Polygons

DOI10.1287/TRSC.20.2.107MaRDI QIDQ3790916zbMATH OpenOpenAlexFDO

Authors Tom M. Cavalier, Hanif D. Sherali

Publication date 1986

Published in Transportation Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/trsc.20.2.107

zbMATH Keywords

computational experienceconvex polygon with uniform demand distributionfixed point algorithmoptimal location for n supply centersoptimality conditionsingle supply centertransportation cost

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Inventory, storage, reservoirs (90B05)

Recommendations

• A minisum location problem with regional demand considering farthest Euclidean distances
• Optimal location of a single facility with circular demand areas
• Allocation of demand when cost is demand-dependent
• A squared-euclidean distance location-allocation problem
• Minisum location with closest Euclidean distances

Cited in

(15)

• Kohonen maps for solving a class of location-allocation problems
• A continuous approximation approach for the integrated facility-inventory allocation problem
• Conditional facility location problems with continuous demand and a polygonal barrier
• A minisum location problem with regional demand considering farthest Euclidean distances
• Estimating demand with distance functions: parameterization in the primal and dual
• Heuristics for a continuous multi-facility location problem with demand regions
• A global shooting algorithm for the facility location and capacity acquisition problem on a line with dense demand
• Structural properties of Voronoi diagrams in facility location problems with continuous demand
• Determining fire station location using convex hull
• A squared-euclidean distance location-allocation problem
• A fast algorithm for locating supplying center on a lattice
• Optimal location of a single facility with circular demand areas
• The geometry of optimal partitions in location problems
• A multi-dimensional shooting algorithm for the two-facility location-allocation problem with dense demand
• A continuous analysis framework for the solution of location-allocation problems with dense demand

This page was built for publication: Euclidean Distance Location-Allocation Problems with Uniform Demands over Convex Polygons

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