| Article ID: | iaor20081998 |
| Country: | China |
| Volume: | 22 |
| Issue: | 2 |
| Start Page Number: | 102 |
| End Page Number: | 104 |
| Publication Date: | Jun 2006 |
| Journal: | Yantai Normal University Journal |
| Authors: | Zhou Li, Sui Lei, Sha Xiuyan |
| Keywords: | lagrange multipliers |
The complexity of Lagrangian relaxation algorithm and optimal algorithm are compared, and the Lagrangian relaxation algorithm is applied to 3-D assignment problem. The result shows that the Lagrangian relaxation algorithm decreases the calculation burden of 3-D assignment problem, and it is a valid algorithm.