Computationally Difficult Instances for the Uncapacitated Facility Location Problem
Authors:
- 10 August 2005
- book chapter
- Published by Springer Nature
- p. 351-367
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Network distance characteristics that affect computational effort in p-median location problemsEuropean Journal of Operational Research, 2000
- Network and Discrete Location1995
- Facility Location1995
- How easy is local search?Journal of Computer and System Sciences, 1988
- The simple plant location problem: Survey and synthesisEuropean Journal of Operational Research, 1983
- A Dual-Based Procedure for Uncapacitated Facility LocationOperations Research, 1978