Lagrangian heuristic for a class of the generalized assignment problems

DOI10.1016/j.camwa.2010.03.070zbMath1201.90119OpenAlexW1975799243MaRDI QIDQ611434

Jania Saucedo, Socorro Rangel, Miguel Mata, Igor S. 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

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

Related Items

Matheuristics: survey and synthesis ⋮ Packing convex polygons in minimum-perimeter convex hulls ⋮ Digital model of natural cores using geometric design ⋮ Solving the wire-harness design problem at a European car manufacturer

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• About Lagrangian methods in integer optimization
• Assignment problems: a golden anniversary survey
• Lagrangian relaxation guided problem space search heuristics for generalized assignment problems
• A Lagrangian bound for many-to-many assignment problems
• Relaxation heuristics for a generalized assignment problem
• The volume algorithm revisited: relation with bundle methods
• Lagrangean/surrogate relaxation for generalized assignment problems
• Benders decomposition, Lagrangean relaxation and metaheuristic design
• Assignment Problems
• A Survey of Lagrangean Techniques for Discrete Optimization
• The Traveling-Salesman Problem and Minimum Spanning Trees