A dynamic location problem with maximum decreasing capacities

DOI10.1007/s10100-008-0055-1zbMath1279.90101DBLPjournals/cejor/DiasCC08OpenAlexW2156286249WikidataQ59682319 ScholiaQ59682319MaRDI QIDQ953304

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

Publication date: 17 November 2008

Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10316/7912

zbMATH Keywords

heuristicsdynamic location problems

Mathematics Subject Classification ID

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

Related Items (3)

Circular economy implementation in waste management network design problem: a case study ⋮ Simple dynamic location problem with uncertainty: a primal-dual heuristic approach ⋮ Or in the industrial engineering of industry 4.0: experiences from the Iberian Peninsula mirrored in CJOR

Cites Work

• A comparison of heuristics and relaxations for the capacitated plant location problem
• Efficient primal-dual heuristic for a dynamic location problem
• The capacitated plant location problem
• A direct dual method for the mixed plant location problem with some side constraints
• A Dual-Based Procedure for Uncapacitated Facility Location
• A Dual-Based Procedure for Dynamic Facility Location
• Capacitated dynamic location problems with opening, closure and reopening of facilities

This page was built for publication: A dynamic location problem with maximum decreasing capacities