๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The singly constrained assignment problem: A Lagrangian relaxation heuristic algorithm

โœ Scribed by Jeffery L. Kennington; Farin Mohammadi

Publisher
Springer US
Year
1994
Tongue
English
Weight
1005 KB
Volume
3
Category
Article
ISSN
0926-6003

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Lagrangian heuristic for a class of the
Lagrangian heuristic for a class of the generalized assignment problems
โœ Igor Litvinchev; Miguel Mata; Socorro Rangel; Jania Saucedo ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 314 KB

A Lagrangian based heuristic is proposed for many-to-many assignment problems taking into account capacity limits for task and agents. A modified Lagrangian bound studied earlier by the authors is presented and a greedy heuristic is then applied to get a feasible Lagrangian-based solution. The latte