An efficient algorithm for facility location in the presence of forbidden regions
Authors:
- 1 April 1996
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 90 (1) , 56-70
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- L 1 shortest paths among polygonal obstacles in the planeAlgorithmica, 1992
- An Output-Sensitive Algorithm for Computing Visibility GraphsSIAM Journal on Computing, 1991
- Shortest paths in euclidean graphsAlgorithmica, 1986
- Shortest paths in the plane with convex polygonal obstaclesInformation Processing Letters, 1986
- Finding shortest paths in the plane in the presence of barriers to travel (for any lp - norm)European Journal of Operational Research, 1985
- Finding minimum rectilinear distance paths in the presence of barriersNetworks, 1981
- Facility location in the presence of forbidden regions, I: Formulation and the case of Euclidean distance with one forbidden circleEuropean Journal of Operational Research, 1981
- An algorithm for planning collision-free paths among polyhedral obstaclesCommunications of the ACM, 1979
- AN EFFICIENT ALGORITHM FOR THE NUMERICAL SOLUTION OF THE GENERALIZED WEBER PROBLEM IN SPATIAL ECONOMICSJournal of Regional Science, 1962
- A note on two problems in connexion with graphsNumerische Mathematik, 1959