Probabilistic analysis of the generalised assignment problem

Probabilistic analysis of the generalised assignment problem

0.00 Avg rating—0 Votes
Article ID: iaor1993696
Country: Netherlands
Volume: 55
Issue: 2
Start Page Number: 169
End Page Number: 181
Publication Date: Jun 1992
Journal: Mathematical Programming
Authors: ,
Keywords: computational analysis
Abstract:

The authors analyse the generalised assignment problem under the assumption that all coefficients are drawn uniformly and independently from [0,1]. They show that such problems can be solved exactly with high probability, in a well-defined sense. The results are closely related to earlier work of Lueker, Goldberg and Marchetti-Spaccamela and ourselves.

Reviews

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