Location of facilities with rectangular distances among point and area destinations
From MaRDI portal
Publication:5620465
DOI10.1002/nav.3800180107zbMath0216.54202OpenAlexW1991106785MaRDI QIDQ5620465
Love, Robert F., George O. Wesolowsky
Publication date: 1971
Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.3800180107
Related Items (19)
On tabu search for the location of interacting hub facilities ⋮ Imprecise weights in Weber facility location problem ⋮ Regional service coverage modeling ⋮ Dominance rules for the optimal placement of a finite-size facility in an existing layout ⋮ The Weber obnoxious facility location model: a big arc small arc approach ⋮ Minisum location problem with farthest Euclidean distances ⋮ A directional approach to gradual cover ⋮ A new algorithm for the minimax location problem with the closest distance ⋮ Location Science in Canada ⋮ A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand ⋮ An algorithm for generalized constrained multi-source Weber problem with demand substations ⋮ Competitive location problems: balanced facility location and the one-round Manhattan Voronoi game ⋮ Competitive location problems: balanced facility location and the one-round Manhattan Voronoi game ⋮ Normative location theory: Placement in continuous space ⋮ Geographical information systems and location science ⋮ Locating facilities by minimax relative to closest points of demand areas ⋮ Solution methods for a min-max facility location problem with regional customers considering closest Euclidean distances ⋮ A heuristic algorithm for constrained multi-source location problem with closest distance under gauge: the variational inequality approach ⋮ The Weber problem with regional demand
Cites Work
This page was built for publication: Location of facilities with rectangular distances among point and area destinations
