Home > Research > Publications & Outputs > A branch-and-bound algorithm for finding all op...
View graph of relations

A branch-and-bound algorithm for finding all optimal solutions of the assignment problem

Research output: Working paper

Published
NullPointerException

Abstract

Alternative optimal solutions can give more choice for practical decision making. Therefore, the provision of special 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.