An efficient algorithm for the location-allocation problem with rectangular regions

DOI10.1002/nav.3800280213zbMath0462.90029OpenAlexW2094604251MaRDI QIDQ3912331

Adel A. Aly, Ann S. Marucheck

Publication date: 1981

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800280213

zbMATH Keywords

exact solutionfacility locationbranch and bound algorithmefficient algorithmlocation-allocation problemrectangular regionsrectilinear normminimization of total weighted distance

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Inventory, storage, reservoirs (90B05) Boolean programming (90C09)

Related Items

A localization and reformulation discrete programming approach for the rectilinear distance location-allocation problem ⋮ Structural Properties of Voronoi Diagrams in Facility Location Problems with Continuous Demand ⋮ Regional service coverage modeling ⋮ Self-organizing feature maps for solving location--allocation problems with rectilinear distances. ⋮ Conditional facility location problems with continuous demand and a polygonal barrier ⋮ 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 ⋮ Kohonen maps for solving a class of location-allocation problems