𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A new Lagrangian relaxation approach to the generalized assignment problem

✍ Scribed by Kurt Jörnsten; Mikael Näsberg

Book ID
107991794
Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
676 KB
Volume
27
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lagrangian relaxation approach to the ta
Lagrangian relaxation approach to the targeting problem
✍ Ojeong Kwon; Donghan Kang; Kyungsik Lee; Sungsoo Park 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 116 KB

In this paper, we consider a new weapon-target allocation problem with the objective of minimizing the overall firing cost. The problem is formulated as a nonlinear integer programming model. We applied Lagrangian relaxation and a branch-and-bound method to the problem after transforming the nonline

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