Article ID: | iaor20062903 |
Country: | Germany |
Volume: | 67 |
Issue: | 2 |
Start Page Number: | 242 |
End Page Number: | 250 |
Publication Date: | Feb 2006 |
Journal: | Automation and Remote Control |
Authors: | Sergeev S.I. |
Keywords: | graphs |
For the three-dimensional assignment problem, new sharp lower bounds are derived from its relationship with the partition problem. The new sharp lower bounds derived for the partition problem from optimal control theory are of great value not only for the three-dimensional assignment problem, but also for the partition problem itself.