Heuristicas de descomposicion lagrangiana para algunos problemas de localizacion discreta

DOI10.1007/BF02888252zbMath0759.90059OpenAlexW1533553764MaRDI QIDQ4022744

A. Marín Pérez, Blas Pelegrín Pelegrín

Publication date: 17 January 1993

Published in: Trabajos de Investigacion Operativa (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02888252

zbMATH Keywords

heuristic algorithmsLagrangian decompositionsubgradient optimizationsimple plant locationgeneralized \(p\)-median

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05) Discrete location and assignment (90B80) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (1)

The return plant location problem: Modelling and resolution

Cites Work

• Unnamed Item
• 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

This page was built for publication: Heuristicas de descomposicion lagrangiana para algunos problemas de localizacion discreta