Restricted center problems under polyhedral gauges
From MaRDI portal
Publication:1291660
DOI10.1016/S0377-2217(97)00189-6zbMath0955.90071MaRDI QIDQ1291660
Publication date: 22 February 2001
Published in: European Journal of Operational Research (Search for Journal in Brave)
Related Items
A generalized Weber problem with different gauges for different regions ⋮ A variational inequality approach for constrained multifacility Weber problem under gauge ⋮ Asymmetric distances, semidirected networks and majority in Fermat-Weber problems ⋮ A heuristic algorithm for constrained multi-source location problem with closest distance under gauge: the variational inequality approach
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Localization in single facility location
- Geometrical properties of the Fermat-Weber problem
- Sets of efficient points in a normed space
- Multicriteria planar location problems
- Combinatorial algorithms for some 1-facility median problems in the plane
- Time bounds for selection
- On superlinear convergence in univariate nonsmooth minimization
- A new linear algorithm for intersecting convex polygons
- An Algorithm for a Constrained Weber Problem
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- Facility Locations with the Manhattan Metric in the Presence of Barriers to Travel
- Using Block Norms for Location Modeling
- Single Facility $l_p $-Distance Minimax Location
- Technical Note—Algorithms for Weber Facility Location in the Presence of Forbidden Regions and/or Barriers to Travel
- The generalized Weber problem with expected distances
