The use of state space relaxation for the dynamic facility location problem

DOI10.1007/BF02097803zbMath0707.90062OpenAlexW1969497939MaRDI QIDQ920008

C. D. T. Watson-Gandy, M. Frantzeskakis

Publication date: 1989

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02097803

zbMATH Keywords

branch and boundplanning horizonstate space relaxationDynamic facility location

Mathematics Subject Classification ID

Dynamic programming (90C39) Discrete location and assignment (90B80) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (4)

A computational comparison of several formulations for the multi-period incremental service facility location problem ⋮ Multi-capacitated Location Problem: A New Resolution Method Combining Exact and Heuristic Approaches Based on Set Partitioning ⋮ Forecast horizons and dynamic facility location planning ⋮ Facility location models for distribution system design

Cites Work

• Unnamed Item
• A comparative study of approaches to dynamic location problems
• The dynamic set covering problem
• Dynamic versions of set covering type public facility location problems
• The Multiregion Dynamic Capacity Expansion Problem: An Improved Heuristic
• State-space relaxation procedures for the computation of bounds to routing problems
• Operations Research and Capacity Expansion Problems: A Survey
• A Dual-Based Procedure for Dynamic Facility Location
• The Multiperiod Location-Allocation Problem with Relocation of Facilities
• Multilocation Plant Sizing and Timing
• An Algorithm for the Traveling Salesman Problem

This page was built for publication: The use of state space relaxation for the dynamic facility location problem