On the resolution of the single product capacitated machine siting problem

DOI10.1057/PALGRAVE.JORS.2600991MaRDI QIDQ3156636zbMATH OpenOpenAlexFDO

Authors R. Cañavate-Bernal, M. Landete-Ruiz, A. Marín Pérez

Publication date 10 January 2005

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1057/palgrave.jors.2600991

zbMATH Keywords

heuristicsinteger programmingLagrangean relaxationlocationsubgradient optimisation

Mathematics Subject Classification ID

Continuous location (90B85) Approximation methods and heuristics in mathematical programming (90C59) Applications of mathematical programming (90C90)

Recommendations

• Efficient solution of large scale, single-source, capacitated plant location problems
• A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints
• An exact algorithm for the capacitated facility location problems with single sourcing
• A Lagrangian Heuristic for the Capacitated Plant Location Problem with Side Constraints
• Approximate solutions to large scale capacitated facility location problems

This page was built for publication: On the resolution of the single product capacitated machine siting problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3156636)