Probabilistic Analysis of the Generalised Assignment Problem

We analyse the generalised assignment problem under the assumption that all coefficients are drawn uniformly and independently from [0,1]. We 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.

• Type: Conference
• Year: 1990
• Where: IPCO
• Authors: Martin E. Dyer, Alan M. Frieze
• Keywords: Assignment Problem, Earlier Work, IPCO 1990, IPCO 2007, Well-defined Sense