𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A New Lagrangian Relaxation Based Algorithm for a Class of Multidimensional Assignment Problems

✍ Scribed by Aubrey B. Poore; Alexander J. Robertson III

Book ID
110265992
Publisher
Springer US
Year
1997
Tongue
English
Weight
579 KB
Volume
8
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

Heuristic Algorithm with Oscillation Str
Heuristic Algorithm with Oscillation Strategy for a New Class of Assignment Problem
✍ Jia-xiang LUO; Li-xin TANG; Yue-ming HU πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier βš– 244 KB

A new class of assignment problem which roots in the optimization management of slabs in steel industry is considered in this article. Compared with the generalized assignment problem, flow constraints should be considered in this problem besides the capacity constraints when assigning items to knap