A BRANCH-AND-BOUND ALGORITHM FOR FINDING ALL OPTIMAL SOLUTIONS OF THE ASSIGNMENT PROBLEM
Zhuo Fu (),
Richard Eglese and
Mike Wright Additional contact information Zhuo Fu: School of Traffic and Transportation Engineering, Central South University at Railway Campus, Changsha 410075, P. R. China
Richard Eglese: Lancaster University, Lancaster, UK
Mike Wright: School of Traffic and Transportation Engineering, Central South University at Railway Campus, Changsha 410075, P. R. China
Abstract:
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.