Capacitated dynamic location problems with opening, closure and reopening of facilities

DOI10.1093/IMAMAN/DPL003zbMath1126.90044OpenAlexW2055338514WikidataQ59682374 ScholiaQ59682374MaRDI QIDQ5427775

Joana Dias, Maria Eugénia Captivo, Joao Carlos Namorado Climaco

Publication date: 27 November 2007

Published in: IMA Journal of Management Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/imaman/dpl003

zbMATH Keywords

heuristicsdynamic location problems

Mathematics Subject Classification ID

Continuous location (90B85) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (13)

A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem ⋮ Capacity management in public service facility networks: a model, computational tests and a case study ⋮ A new formulation and Benders decomposition for the multi-period maximal covering facility location problem with server uncertainty ⋮ Efficient primal-dual heuristic for a dynamic location problem ⋮ Solving a dynamic facility location problem with partial closing and reopening ⋮ Multi-capacitated Location Problem: A New Resolution Method Combining Exact and Heuristic Approaches Based on Set Partitioning ⋮ Lagrangian Heuristics for Large-Scale Dynamic Facility Location with Generalized Modular Capacities ⋮ Dynamic-demand capacitated facility location problems with and without relocation ⋮ A dynamic location problem with maximum decreasing capacities ⋮ A memetic algorithm for multi-objective dynamic location problems ⋮ Modeling and solving a logging camp location problem ⋮ Two-Stage Flow Distribution Model Based on Multi-objective Optimization ⋮ Notation and classification for logistic network design models

This page was built for publication: Capacitated dynamic location problems with opening, closure and reopening of facilities