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 (2007) A branch-and-bound algorithm for finding all optimal solutions of the assignment problem. Asia-Pacific Journal of Operational Research, 24 (6). pp. 831-839. ISSN 0217-5959

Full text not available from this repository.
Item Type: Article
Journal or Publication Title: Asia-Pacific Journal of Operational Research
Subjects: UNSPECIFIED
Departments: Lancaster University Management School > Management Science
ID Code: 44785
Deposited By: ep_importer_pure
Deposited On: 11 Jul 2011 19:21
Refereed?: Yes
Published?: Published
Last Modified: 26 Jul 2012 19:07
Identification Number:
URI: http://eprints.lancs.ac.uk/id/eprint/44785

Actions (login required)

View Item