Hull properties in location problems
From MaRDI portal
Publication:1173003
Cites work
- A computation procedure for the exact solution of location-allocation problems with rectangular distances
- Finding efficient solutions for rectilinear distance location problems efficiently
- scientific article; zbMATH DE number 955453 (Why is no real title available?)
- scientific article; zbMATH DE number 3291744 (Why is no real title available?)
- Location Theory, Dominance, and Convexity
- Properties of a multifacility location problem involving euclidian distances
- Solutions of Constrained Location Problems
- Technical Note—Location Theory, Dominance, and Convexity: Some Further Results
Cited in
(12)- Geometrical properties of the Fermat-Weber problem
- Localization in multifacility location theory
- An optimal method for solving the (generalized) multi-Weber problem
- Dominating sets for convex functions with some applications
- Planar point-objecitve location problems with nonconvex constraints: A geometrical construction
- A game-theoretic approach for downgrading the 1-median in the plane with Manhattan metric
- A unified model for Weber problems with continuous and network distances
- Planar weber location problems with line barriers
- Recovery-to-optimality: a new two-stage approach to robustness with an application to aperiodic timetabling
- Convex hull properties in location theory
- Construction Line Algorithms for the Connection Location-Allocation Problem
- Localization in single facility location
This page was built for publication: Hull properties in location problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1173003)
