A computation procedure for the exact solution of location-allocation problems with rectangular distances
From MaRDI portal
Publication:4106004
DOI10.1002/nav.3800220304zbMath0338.90057OpenAlexW2066379670MaRDI QIDQ4106004
James G. Morris, Love, Robert F.
Publication date: 1975
Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.3800220304
Related Items
A localization and reformulation discrete programming approach for the rectilinear distance location-allocation problem, Sets of efficient points in a normed space, Localization in multifacility location theory, A new heuristic for solving the \(p\)-median problem in the plane, Comparison of genetic algorithms, random restart and two-opt switching for solving large location-allocation problems, A two-echelon joint continuous-discrete location model, Mean-variance value at risk criterion for solving a \(p\)-median location problem on networks with type-2 intuitionistic fuzzy weights, A cellular heuristic for the multisource Weber problem., Self-organizing feature maps for solving location--allocation problems with rectilinear distances., Hull properties in location problems, Algorithms for location problems based on angular distances, Classical and inverse median location problems under uncertain environment, Optimizing the location of a production firm, Allocation search methods for a generalized class of location-allocation problems, Approximation of solutions for location problems, Geometrical properties of the Fermat-Weber problem, An efficient hybrid particle swarm optimization algorithm for solving the uncapacitated continuous location-allocation problem
Cites Work
