Heuristicas de descomposicion lagrangiana para algunos problemas de localizacion discreta
From MaRDI portal
Publication:4022744
DOI10.1007/BF02888252zbMath0759.90059MaRDI QIDQ4022744
Blas Pelegrín Pelegrín, A. Marín Pérez
Publication date: 17 January 1993
Published in: Trabajos de Investigacion Operativa (Search for Journal in Brave)
heuristic algorithms; Lagrangian decomposition; subgradient optimization; simple plant location; generalized \(p\)-median
90C10: Integer programming
90C05: Linear programming
90B80: Discrete location and assignment
90-08: Computational methods for problems pertaining to operations research and mathematical programming
Related Items
Cites Work
- A projection method for the uncapacitated facility location problem
- An application-oriented guide for designing Lagrangean dual ascent algorithms
- The simple plant location problem: Survey and synthesis
- On the Uncapacitated Plant Location Problem. I: Valid Inequalities and Facets
- A Dual-Based Procedure for Uncapacitated Facility Location
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Heuristics for the fixed cost median problem
- Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
- Unnamed Item