Efficient primal-dual heuristic for a dynamic location problem
From MaRDI portal
Publication:858286
DOI10.1016/j.cor.2005.07.005zbMath1159.90439DBLPjournals/cor/DiasCC07OpenAlexW2114570999WikidataQ59682367 ScholiaQ59682367MaRDI QIDQ858286
Joana Dias, Joao Carlos Namorado Climaco, Maria Eugénia Captivo
Publication date: 9 January 2007
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10316/5490
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (13)
A study on the budget constrained facility location model considering inventory management cost ⋮ Heuristic algorithms for solving an integrated dynamic center facility location -- network design model ⋮ Location and reorganization problems: the Calabrian health care system case ⋮ A new formulation and Benders decomposition for the multi-period maximal covering facility location problem with server uncertainty ⋮ Integrated strategic and tactical supply chain planning with price-sensitive demands ⋮ Multistage system planning for hydrogen production and distribution ⋮ Dynamic location of modular manufacturing facilities with relocation of individual modules ⋮ 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 ⋮ Simple dynamic location problem with uncertainty: a primal-dual heuristic approach ⋮ Lower and upper bounds for a two-stage capacitated facility location problem with handling costs ⋮ Facility location and supply chain management. A review
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A comparative study of approaches to dynamic location problems
- A Langrangean heuristic for the \(p_ k\)-median dynamic location problem
- A multiperiod two-echelon multicommodity capacitated plant location problem
- Lagrangean heuristics for location problems
- The simple plant location problem: Survey and synthesis
- Dynamic Location-routeing Problems
- A Dual-Based Procedure for Uncapacitated Facility Location
- The Multiregion Dynamic Capacity Expansion Problem, Part I
- The Multiregion Dynamic Capacity Expansion Problem, Part II
- A Dual-Based Procedure for Dynamic Facility Location
- An Algorithm for Solving Dynamic Capacitated Plant Location Problems with Discrete Expansion Sizes
- The Multiperiod Location-Allocation Problem with Relocation of Facilities
- A Parametric Decomposition Approach for the Solution of Uncapacitated Location Problems
- Modeling Facility Location Problems as Generalized Assignment Problems
- A multiobjective model for the dynamic location of landfills
- Capacitated dynamic location problems with opening, closure and reopening of facilities
- Solving the dynamic facility location problem
- On solving complex multi-period location models using simulated annealing.
- An algorithm for the capacitated, multi-commodity multi-period facility location problem.
This page was built for publication: Efficient primal-dual heuristic for a dynamic location problem
