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

Relaxation heuristics for a generalized assignment problem

โœ Scribed by Luiz Antonio N. Lorena; Marcelo G. Narciso

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
545 KB
Volume
91
Category
Article
ISSN
0377-2217

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

A generalized assignment heuristic for v
A generalized assignment heuristic for vehicle routing
โœ Marshall L. Fisher; Ramchandran Jaikumar ๐Ÿ“‚ Article ๐Ÿ“… 1981 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 742 KB

## Abstract We consider a common variant of the vehicle routing problem in which a vehicle fleet delivers products stored at a central depot to satisfy customer orders. Each vehicle has a fixed capacity, and each order uses a fixed portion of vehicle capacity. The routing decision involves determin