Technical Note—Equivalence between the Direct Search Approach and the Cut Approach to the Rectilinear Distance Location Problem

DOI10.1287/OPRE.29.3.616MaRDI QIDQ3908744zbMATH OpenOpenAlexFDO

Authors Antoon W. J. Kolen

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

zbMATH Keywords

cut approachdirect search approachequivalencefacility locationlogisticsplanar analysisrectilinear distance location problemtwo-dimensional case

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05)

Cited in

(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

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