A comparison of two dual-based procedures for solving the p-median problem
- 30 June 1985
- journal article
- Published by Elsevier BV in European Journal of Operational Research
- Vol. 20 (3), 387-396
- https://doi.org/10.1016/0377-2217(85)90012-8
Abstract
No abstract availableThis publication has 33 references indexed in Scilit:
- Solving covering problems and the uncapacitated plant location problem on treesEuropean Journal of Operational Research, 1983
- The simple plant location problem: Survey and synthesisEuropean Journal of Operational Research, 1983
- A tree search algorithm for the p-median problemEuropean Journal of Operational Research, 1982
- On the choice of step size in subgradient optimizationEuropean Journal of Operational Research, 1981
- A Tight Bound Drop Exchange Algorithm for Solving the p Median ProblemEnvironment and Planning A: Economy and Space, 1981
- A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian dualityEuropean Journal of Operational Research, 1979
- A Note Comparing Optimal and Heuristic Solutions To the p‐Median ProblemGeographical Analysis, 1979
- Lagrangean relaxation for integer programmingPublished by Springer Science and Business Media LLC ,1974
- Central Facilities LocationGeographical Analysis, 1970
- On the Location of Supply Points to Minimize Transport CostsJournal of the Operational Research Society, 1964