| Article ID: | iaor20084117 |
| Country: | Singapore |
| Volume: | 24 |
| Issue: | 6 |
| Start Page Number: | 831 |
| End Page Number: | 839 |
| Publication Date: | Dec 2007 |
| Journal: | Asia-Pacific Journal of Operational Research |
| Authors: | Eglese Richard W., Wright Mike, Fu Zhuo |
| Keywords: | programming: branch and bound |
Alternative optimal solutions can give more choice for practical decision making. Therefore, the provision of methods for finding alternative optimal solutions is an important component part of the solution techniques for optimization models. The aim of this paper is to present a branch-and-bound algorithm for finding all optimal solutions of the linear assignment problem. Numerical experimental results are also given.