The single period coverage facility location problem: Lagrangean heuristic and column generation approaches
From MaRDI portal
Publication:610996
DOI10.1007/s11750-009-0102-7zbMath1201.90108OpenAlexW1972238233WikidataQ58217221 ScholiaQ58217221MaRDI QIDQ610996
Justo Puerto, Maria Albareda-Sambola, Yolanda Hinojosa, Elena Fernández
Publication date: 13 December 2010
Published in: Top (Search for Journal in Brave)
Full work available at URL: https://idus.us.es/handle//11441/83316
Related Items (1)
Cites Work
- Unnamed Item
- Forecast horizons and dynamic facility location planning
- The multi-period incremental service facility location problem
- Facility location and supply chain management. A review
- A Langrangean heuristic for the \(p_ k\)-median dynamic location problem
- Dynamic facility location when the total number of facilities is uncertain: A decision analysis approach
- The capacitated plant location problem
- Upper and lower bounds for the single source capacitated location problem.
- A multiperiod two-echelon multicommodity capacitated plant location problem
- Greedy randomized adaptive search procedures
- Lagrangean relaxation. (With comments and rejoinder).
- Dynamic supply chain design with inventory
- Solving the variable size bin packing problem with discretized formulations
- Dynamic multi-commodity capacitated facility location: a mathematical modeling framework for strategic supply chain planning
- A Dual-Based Procedure for Dynamic Facility Location
- Dynamic facility location: The progressive p-median problem
- Multi-Dimensional Location Problems
- Solving the dynamic facility location problem
This page was built for publication: The single period coverage facility location problem: Lagrangean heuristic and column generation approaches
