On the expected number of assignments in reduced matrices for the linear assignment problem

On the expected number of assignments in reduced matrices for the linear assignment problem

0.00 Avg rating—0 Votes
Article ID: iaor19891080
Country: Netherlands
Volume: 8
Issue: 6
Start Page Number: 329
End Page Number: 335
Publication Date: Dec 1989
Journal: Operations Research Letters
Authors: ,
Keywords: Linear assignment problem
Abstract:

A linear n×n assignment problem is considered for which the elements of the cost matrix are sampled from a continuous probability distribution. Based on the zero entries of the reduced matrix the expectation of the maximum number of initial assignments is determined for general n, as well as an asymptotic value for large n.

Reviews

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