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

Lagrangian approaches for a class of matching problems in computational biology

โœ Scribed by Nicola Yanev; Rumen Andonov; Philippe Veber; Stefan Balev

Book ID
108077122
Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
832 KB
Volume
55
Category
Article
ISSN
0898-1221

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