The directional p-median problem: Definition, complexity, and algorithms
Authors:
- Laura E. JacksonLJLaura E. Jackson
- George N. RouskasGRGeorge N. Rouskas
- Matthias F.M. StallmannMSMatthias F.M. Stallmann
- 1 June 2007
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 179 (3) , 1097-1108
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Mixed Pfair/ERfair scheduling of asynchronous periodic tasksJournal of Computer and System Sciences, 2004
- Optimal quantization of periodic task requests on multiple identical processorsIEEE Transactions on Parallel and Distributed Systems, 2003
- Network distance characteristics that affect computational effort in p-median location problemsEuropean Journal of Operational Research, 2000
- Heuristic concentration: Two stage solution constructionEuropean Journal of Operational Research, 1997
- Proportionate progress: A notion of fairness in resource allocationAlgorithmica, 1996
- Facility siting and integer-friendly programmingEuropean Journal of Operational Research, 1993
- A more efficient heuristic for solving largep-median problemsPapers in Regional Science, 1992
- Improved complexity bounds for location problems on the real lineOperations Research Letters, 1991
- A Note Comparing Optimal and Heuristic Solutions To the p‐Median ProblemGeographical Analysis, 1979
- The shortest route problem with constraintsJournal of Mathematical Analysis and Applications, 1966