Lancaster EPrints

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

Fu, Z and Eglese, R W and Wright, M B (2004) A branch-and-bound algorithm for finding all optimal solutions of the assignment problem. Working Paper. The Department of Management Science, Lancaster University.

Full text not available from this repository.

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.

Item Type: Monograph (Working Paper)
Uncontrolled Keywords: linear programming ; assignment problem ; alternative optimal solutions ; branch-and-bound
Subjects: UNSPECIFIED
Departments: Lancaster University Management School > Management Science
ID Code: 48729
Deposited By: ep_importer_pure
Deposited On: 11 Jul 2011 22:09
Refereed?: No
Published?: Published
Last Modified: 17 Sep 2013 18:26
Identification Number:
URI: http://eprints.lancs.ac.uk/id/eprint/48729

Actions (login required)

View Item