The use of state space relaxation for the dynamic facility location problem
- 1 December 1989
- journal article
- section iv-discrete-and-network-location-problems
- Published by Springer Nature in Annals of Operations Research
- Vol. 18 (1) , 187-211
- https://doi.org/10.1007/bf02097803
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- The Multiregion Dynamic Capacity Expansion Problem: An Improved HeuristicManagement Science, 1986
- Operations Research and Capacity Expansion Problems: A SurveyOperations Research, 1982
- Dynamic versions of set covering type public facility location problemsEuropean Journal of Operational Research, 1982
- The dynamic set covering próblemApplied Mathematical Modelling, 1982
- State‐space relaxation procedures for the computation of bounds to routing problemsNetworks, 1981
- A comparative study of approaches to dynamic location problemsEuropean Journal of Operational Research, 1981
- Applications of the Location Set‐covering ProblemGeographical Analysis, 1976
- Capacity Planning for Large Multilocation Systems: Approximate and Incomplete Dynamic Programming ApproachesManagement Science, 1975
- Optimal and Heuristic Facility Phase-out StrategiesA I I E Transactions, 1975
- Dynamic Warehouse Location AnalysisJournal of Marketing Research, 1968