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

Management Science

Keywords

linear programming, assignment problem, alternative optimal solutions, branch-and-bound

Research output: Working paper

Published

Standard

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

Research output: Working paper

Harvard

Fu, Z, Eglese, RW & Wright, MB 2004 'A branch-and-bound algorithm for finding all optimal solutions of the assignment problem' Management Science Working Paper Series, The Department of Management Science, Lancaster University.

APA

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

Vancouver

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

Author

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

Bibtex

@techreport{303063204b0f4ce2886198684ab87f39,

title = "A branch-and-bound algorithm for finding all optimal solutions of the assignment problem",

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.",

keywords = "linear programming, assignment problem, alternative optimal solutions, branch-and-bound",

author = "Z Fu and Eglese, {R W} and Wright, {M B}",

year = "2004",

language = "English",

series = "Management Science Working Paper Series",

publisher = "The Department of Management Science",

type = "WorkingPaper",

institution = "The Department of Management Science",

}

RIS

TY - UNPB

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

AU - Fu, Z

AU - Eglese, R W

AU - Wright, M B

PY - 2004

Y1 - 2004

N2 - 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.

AB - 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.

KW - linear programming

KW - assignment problem

KW - alternative optimal solutions

KW - branch-and-bound

M3 - Working paper

T3 - Management Science Working Paper Series

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

PB - The Department of Management Science

CY - Lancaster University

ER -

Research

Keywords