A Langrangean heuristic for the \(p_ k\)-median dynamic location problem
From MaRDI portal
Publication:1194737
DOI10.1016/0377-2217(92)90211-QzbMath0764.90057OpenAlexW2009187298MaRDI QIDQ1194737
Ernesto del R. Santibañez-Gonzalez, Roberto Diéguez Galvão
Publication date: 6 October 1992
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(92)90211-q
Integer programming (90C10) Discrete location and assignment (90B80) Boolean programming (90C09) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Location and reorganization problems: the Calabrian health care system case ⋮ Integrated strategic and tactical supply chain planning with price-sensitive demands ⋮ Fix-and-relax-coordination for a multi-period location-allocation problem under uncertainty ⋮ Efficient primal-dual heuristic for a dynamic location problem ⋮ The single period coverage facility location problem: Lagrangean heuristic and column generation approaches ⋮ A computational comparison of several formulations for the multi-period incremental service facility location problem ⋮ GENETIC ALGORITHM SOLUTION FOR MULTI-PERIOD TWO-ECHELON INTEGRATED COMPETITIVE/UNCOMPETITIVE FACILITY LOCATION PROBLEM ⋮ Evasive flow capture: a multi-period stochastic facility location problem with independent demand ⋮ The multi-period incremental service facility location problem ⋮ On efficient matheuristic algorithms for multi-period stochastic facility location-assignment problems ⋮ The dynamic relocation and phase-out of a hybrid two-echelon plant/warehousing facility: A multiple objective approach ⋮ Dynamic multi-commodity capacitated facility location: a mathematical modeling framework for strategic supply chain planning ⋮ The traveling \(k\)-median problem: approximating optimal network coverage
Cites Work
- A comparison of heuristics and relaxations for the capacitated plant location problem
- Dual formulations and subgradient optimization strategies for linear programming relaxations of mixed-integer programs
- On the choice of step size in subgradient optimization
- Lagrangean heuristics for location problems
- A Dual-Based Procedure for Dynamic Facility Location
- A Survey of Lagrangean Techniques for Discrete Optimization
- Validation of subgradient optimization
- Multi-Dimensional Location Problems
