Solving linear bottleneck assignment problems via strong spanning trees

Solving linear bottleneck assignment problems via strong spanning trees

0.00 Avg rating—0 Votes
Article ID: iaor19931166
Country: Netherlands
Volume: 12
Issue: 3
Start Page Number: 179
End Page Number: 183
Publication Date: Sep 1992
Journal: Operations Research Letters
Authors: ,
Keywords: graphs
Abstract:

An efficient algorithm for solving the n×n linear bottleneck assignment problem is described. This algorithm utilizes the strong spanning tree and runs in O(mn+n2logn) for sparse problems with m arcs.

Reviews

Required fields are marked *. Your email address will not be published.