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

DOI10.1007/BF02097803MaRDI QIDQ920008zbMATH OpenOpenAlexFDO

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

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 boundDynamic facility locationplanning horizonstate space relaxation

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 5064928
• Solving the dynamic facility location problem
• Lagrangean relaxation-based techniques for solving facility location problems
• Optimization models for the dynamic facility location and allocation problem
• scientific article; zbMATH DE number 5811147
• Facility location with dynamic distance functions
• scientific article; zbMATH DE number 2086966
• scientific article; zbMATH DE number 1253042
• An approximation algorithm for the soft-capacitated dynamic facility location problem
• An improved Lagrangian relaxation and dual ascent approach to facility location problems

Cites work

• A comparative study of approaches to dynamic location problems
• A Dual-Based Procedure for Dynamic Facility Location
• An Algorithm for the Traveling Salesman Problem
• Dynamic versions of set covering type public facility location problems
• scientific article; zbMATH DE number 3575389 (Why is no real title available?)
• Multilocation Plant Sizing and Timing
• Operations Research and Capacity Expansion Problems: A Survey
• State-space relaxation procedures for the computation of bounds to routing problems
• The dynamic set covering problem
• The Multiperiod Location-Allocation Problem with Relocation of Facilities
• The Multiregion Dynamic Capacity Expansion Problem: An Improved Heuristic

Cited in

(5)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q920008)