Technical Note—Equivalence between the Direct Search Approach and the Cut Approach to the Rectilinear Distance Location Problem
From MaRDI portal
Publication:3908744
DOI10.1287/opre.29.3.616zbMath0458.90020OpenAlexW2045278390MaRDI QIDQ3908744
Publication date: 1981
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.29.3.616
equivalencefacility locationlogisticstwo-dimensional casecut approachdirect search approachplanar analysisrectilinear distance location problem
Related Items (3)
Locational analysis ⋮ 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
This page was built for publication: Technical Note—Equivalence between the Direct Search Approach and the Cut Approach to the Rectilinear Distance Location Problem