Efficient primal-dual heuristic for a dynamic location problem
type: Item
instance of: scholarly article
title: Efficient primal-dual heuristic for a dynamic location problem
zbMATH Open document ID: 1159.90439
author: Joana Dias
author: Maria Eugénia Captivo
author: Joao Carlos Namorado Climaco
published in: Computers \& Operations Research
publication date: 2007-01-09T00:00:00Z
full work available at URL: http://hdl.handle.net/10316/5490
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 5082747
zbMATH Keywords: location
zbMATH Keywords: heuristics
zbMATH Keywords: branch and bound
Wikidata QID: Q59682367
MaRDI profile type: Publication
OpenAlex ID: W2114570999
cites work: Lagrangean heuristics for location problems
cites work: Q3351135
cites work: A Dual-Based Procedure for Uncapacitated Facility Location
cites work: The simple plant location problem: Survey and synthesis
cites work: Q3352834
cites work: Modeling Facility Location Problems as Generalized Assignment Problems
cites work: A Parametric Decomposition Approach for the Solution of Uncapacitated Location Problems
cites work: A comparative study of approaches to dynamic location problems
cites work: The Multiperiod Location-Allocation Problem with Relocation of Facilities
cites work: The Multiregion Dynamic Capacity Expansion Problem, Part I
cites work: The Multiregion Dynamic Capacity Expansion Problem, Part II
cites work: A Dual-Based Procedure for Dynamic Facility Location
cites work: Dynamic Location-routeing Problems
cites work: Q3358521
cites work: An Algorithm for Solving Dynamic Capacitated Plant Location Problems with Discrete Expansion Sizes
cites work: A Langrangean heuristic for the \(p_ k\)-median dynamic location problem
cites work: A multiobjective model for the dynamic location of landfills
cites work: A multiperiod two-echelon multicommodity capacitated plant location problem
cites work: On solving complex multi-period location models using simulated annealing.
cites work: Solving the dynamic facility location problem
cites work: An algorithm for the capacitated, multi-commodity multi-period facility location problem.
cites work: Q3056948
cites work: Capacitated dynamic location problems with opening, closure and reopening of facilities
DBLP publication ID: journals/cor/DiasCC07
DOI: 10.1016/J.COR.2005.07.005
description: scientific article; zbMATH DE number 5082747