Special issue on Locational analysis
From MaRDI portal
Publication:1284594
DOI10.1007/BF02564785zbMath0915.00034OpenAlexW2016581143WikidataQ74822803 ScholiaQ74822803MaRDI QIDQ1284594
No author found.
Publication date: 23 June 1999
Published in: Top (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02564785
Continuous location (90B85) Collections of articles of miscellaneous specific interest (00B15) Discrete location and assignment (90B80) Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06)
Cites Work
- Unnamed Item
- Geometric complexity of some location problems
- Easy and hard bottleneck location problems
- Linear facility location. Solving extensions of the basic problem
- On the complexity of locating linear facilities in the plane
- Rectilinear paths among rectilinear obstacles
- Computing a Segment Center for a Planar Point Set
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
- One-facility location with rectilinear tour distances
- Minimax location problems with nonlinear costs
- Single Facility $l_p $-Distance Minimax Location
- 1-Segment Center Problems
- The Minimum Covering Sphere Problem
This page was built for publication: Special issue on Locational analysis
