Hull properties in location problems

DOI10.1016/0377-2217(83)90196-0zbMath0502.90020OpenAlexW2009090316MaRDI QIDQ1173003

Henrik Juel, Love, Robert F.

Publication date: 1983

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(83)90196-0

zbMATH Keywords

logisticssingle facility locationhull propertiesl- p-distancemultifacility continuous location problemsrectangular distancesset reduction algorithm

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05)

Related Items (12)

Planar point-objecitve location problems with nonconvex constraints: A geometrical construction ⋮ Localization in multifacility location theory ⋮ A unified model for Weber problems with continuous and network distances ⋮ Recovery-to-optimality: a new two-stage approach to robustness with an application to aperiodic timetabling ⋮ Convex hull properties in location theory ⋮ Dominating sets for convex functions with some applications ⋮ Construction Line Algorithms for the Connection Location-Allocation Problem ⋮ Planar weber location problems with line barriers ⋮ An optimal method for solving the (generalized) multi-Weber problem ⋮ A game-theoretic approach for downgrading the 1-median in the plane with Manhattan metric ⋮ Geometrical properties of the Fermat-Weber problem ⋮ Localization in single facility location

Cites Work

• Unnamed Item
• Unnamed Item
• Finding efficient solutions for rectilinear distance location problems efficiently
• Technical Note—Location Theory, Dominance, and Convexity: Some Further Results
• Solutions of Constrained Location Problems
• A computation procedure for the exact solution of location-allocation problems with rectangular distances
• Properties of a multifacility location problem involving euclidian distances
• Location Theory, Dominance, and Convexity

This page was built for publication: Hull properties in location problems