A dual feasible forest algorithm for the linear assignment problem

A dual feasible forest algorithm for the linear assignment problem

0.00 Avg rating0 Votes
Article ID: iaor19941093
Country: France
Volume: 25
Issue: 4
Start Page Number: 403
End Page Number: 411
Publication Date: Oct 1991
Journal: RAIRO Operations Research
Authors: ,
Keywords: duality
Abstract:

The authors present a dual feasible forest algorithm for the assignment problem. The algorithm is guided by the signature of a strongly feasible tree and terminates with such a tree. It has the time complexity O(n3) for dense problems and O(n2logn+nm) for sparse graphs.

Reviews

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