A BRANCH-AND-BOUND ALGORITHM FOR FINDING ALL OPTIMAL SOLUTIONS OF THE ASSIGNMENT PROBLEM

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

MoreLess

Year of publication:	2007
Authors:	FU, ZHUO ; EGLESE, RICHARD ; WRIGHT, MIKE
Published in:	Asia-Pacific Journal of Operational Research (APJOR). - World Scientific Publishing Co. Pte. Ltd., ISSN 1793-7019. - Vol. 24.2007, 06, p. 831-839
Publisher:	World Scientific Publishing Co. Pte. Ltd.
Subject:	Linear programming \| assignment problem \| alternative optimal solutions \| branch-and-bound

Online Resource

Check full text access |

More access options

www.worldscinet.com

Check Google Scholar

In libraries world-wide (WorldCat)

In German libraries (KVK)

subito order

I need help

More details

Extent:	application/pdf text/html
Type of publication:	Article
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10005047153