Lagrangian heuristic for a class of the generalized assignment problems

DOI10.1016/J.CAMWA.2010.03.070MaRDI QIDQ611434zbMATH OpenOpenAlexFDO

Authors Miguel Mata, Socorro Rangel, Jania Saucedo, I. Litvinchev

Publication date 14 December 2010

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.camwa.2010.03.070

zbMATH Keywords

integer programmingLagrangian heuristicmany-to-many assignment problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Mixed integer programming (90C11) Discrete location and assignment (90B80)

Recommendations

• Improved Lagrangian bounds and heuristics for the generalized assignment problem
• Lagrangean/surrogate relaxation for generalized assignment problems
• Relaxation heuristics for a generalized assignment problem
• A Lagrangian bound for many-to-many assignment problems
• Effective algorithm and heuristic for the generalized assignment problem.

Cites work

• scientific article; zbMATH DE number 3470175 (Why is no real title available?)
• scientific article; zbMATH DE number 1349588 (Why is no real title available?)
• scientific article; zbMATH DE number 1737519 (Why is no real title available?)
• A Lagrangian bound for many-to-many assignment problems
• A Survey of Lagrangean Techniques for Discrete Optimization
• About Lagrangian methods in integer optimization
• Assignment Problems
• Assignment problems: a golden anniversary survey
• Benders decomposition, Lagrangean relaxation and metaheuristic design
• Lagrangean/surrogate relaxation for generalized assignment problems
• Lagrangian relaxation guided problem space search heuristics for generalized assignment problems
• Relaxation heuristics for a generalized assignment problem
• The Traveling-Salesman Problem and Minimum Spanning Trees
• The volume algorithm revisited: relation with bundle methods

Cited in

(13)

• Solving the wire-harness design problem at a European car manufacturer
• Studying properties of Lagrangian bounds for many-to-many assignment problems
• An LP-based metaheuristic procedure for the k-sequential generalized assignment problem
• A Lagrangian Relaxation Approach To The Classroom Assignment Problem^*
• Packing convex polygons in minimum-perimeter convex hulls
• Matheuristics: survey and synthesis
• Lagrangean/surrogate relaxation for generalized assignment problems
• An LP-based heuristic procedure for the generalized assignment problem with special ordered sets
• Improved Lagrangian bounds and heuristics for the generalized assignment problem
• A Lagrangian bound for many-to-many assignment problems
• Digital model of natural cores using geometric design
• Comparison of Lagrangian bounds for one class of generalized assignment problems
• Relaxation heuristics for a generalized assignment problem

Describes a project that uses

Uses Software

• CPLEX

This page was built for publication: Lagrangian heuristic for a class of the generalized assignment problems

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