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

Management Science

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Published

Standard

A branch-and-bound algorithm for finding all optimal solutions of the assignment problem. / Fu, Z; Eglese, R W ; Wright, M B.
In: Asia-Pacific Journal of Operational Research, Vol. 24, No. 6, 2007, p. 831-839.

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Bibtex

@article{ee1f8352fb354fae9f7ecb71215da779,

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

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

year = "2007",

language = "English",

volume = "24",

pages = "831--839",

journal = "Asia-Pacific Journal of Operational Research",

issn = "0217-5959",

publisher = "World Scientific Publishing Co. Pte Ltd",

number = "6",

}

RIS

TY - JOUR

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 - 2007

Y1 - 2007

M3 - Journal article

VL - 24

SP - 831

EP - 839

JO - Asia-Pacific Journal of Operational Research

JF - Asia-Pacific Journal of Operational Research

SN - 0217-5959

IS - 6

ER -

Research