Name
Abstract | ||
|---|---|---|
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 latter is also used to speed up the subgradient scheme to solve the modified Lagrangian dual problem. A numerical study is presented to demonstrate the efficiency of the proposed approach. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1016/j.camwa.2010.03.070 | Computers & Mathematics with Applications |
Keywords | Field | DocType |
generalized assignment problem,dual problem,assignment problem,integer programming,greedy heuristic | Weapon target assignment problem,Mathematical optimization,Heuristic,Subgradient method,Generalized assignment problem,Greedy algorithm,Integer programming,Lagrangian relaxation,Linear bottleneck assignment problem,Mathematics | Journal |
Volume | Issue | ISSN |
60 | 4 | 0898-1221 |
Citations | PageRank | References |
2 | 0.36 | 9 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Igor S. Litvinchev | 1 | 33 | 10.71 |
| Miguel Mata Pérez | 2 | 2 | 0.36 |
| Socorro Rangel | 3 | 71 | 5.62 |
| Jania Saucedo | 4 | 7 | 0.85 |