Comparison of Lagrangian bounds for one class of generalized assignment problems

DOI10.1134/S0965542508050047;zbMATH Open1164.49322MaRDI QIDQ3545175FDOQ3545175

Authors: Socorro Rangel, I. Litvinchev 

Publication date: 9 December 2008

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Recommendations

• Improved Lagrangian bounds and heuristics for the generalized assignment problem
• Lagrangian heuristic for a class of the generalized assignment problems
• A new Lagrangian relaxation approach to the generalized assignment problem
• Lower and upper bounds for the non-linear generalized assignment problem
• An Effective Lagrangian Heuristic For The Generalized Assignment Problem
• A Lagrangian bound for many-to-many assignment problems
• A Rigorous Computational Comparison of Alternative Solution Methods for the Generalized Assignment Problem
• The generalized assignment problem: Valid inequalities and facets
• Studying properties of Lagrangian bounds for many-to-many assignment problems
• Improved Lagrangean decomposition: An application to the generalized assignment problem

zbMATH Keywords

Lagrange relaxationgeneralized problem on assignmentLagrange evaluations for optimization problems

Mathematics Subject Classification ID

Numerical methods of relaxation type (49M20)

Cited In (2)

• Studying properties of Lagrangian bounds for many-to-many assignment problems
• A Lagrangian bound for many-to-many assignment problems

This page was built for publication: Comparison of Lagrangian bounds for one class of generalized assignment problems

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