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

DOI10.1002/NAV.3800280213zbMATH Open0462.90029OpenAlexW2094604251MaRDI QIDQ3912331FDOQ3912331

Authors Ann S. Marucheck, Adel A. Aly

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

facility locationexact solutionefficient algorithmbranch and bound 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)

Cited in

(8)

• A localization and reformulation discrete programming approach for the rectilinear distance location-allocation problem
• Self-organizing feature maps for solving location--allocation problems with rectilinear distances.
• A multi-dimensional shooting algorithm for the two-facility location-allocation problem with dense demand
• Conditional facility location problems with continuous demand and a polygonal barrier
• Regional service coverage modeling
• Kohonen maps for solving a class of location-allocation problems
• A continuous analysis framework for the solution of location-allocation problems with dense demand
• Structural properties of Voronoi diagrams in facility location problems with continuous demand

This page was built for publication: An efficient algorithm for the location-allocation problem with rectangular regions

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