Construction Line Algorithms for the Connection Location-Allocation Problem
From MaRDI portal
Publication:5391943
DOI10.1007/978-3-540-77903-2_53zbMath1209.90225MaRDI QIDQ5391943
Publication date: 7 April 2011
Published in: Operations Research Proceedings (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-77903-2_53
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90B80: Discrete location and assignment
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The \(K\)-connection location problem in a plane
- An efficient solution method for Weber problems with barriers based on genetic algorithms
- Allocation search methods for a generalized class of location-allocation problems
- Geometrical properties of the Fermat-Weber problem
- Hull properties in location problems
- Planar Weber location problems with barriers and block norms
- Location-Allocation Problems
- Technical Note—A New Norm for Measuring Distance Which Yields Linear Location Problems
- On the Set of Optimal Points to the Weber Problem: Further Results