Skip to main content
SpringerLink
Log in

Probabilistic analysis of the generalised assignment problem

  • Published:
Mathematical Programming Submit manuscript

Abstract

We analyse thegeneralised 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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. J.F. Benders and J.A.E.E. van Nunen, “A property of assignment type mixed integer linear programming problems,”Operations Research Letters 2 (1983) 47–52.

    Google Scholar 

  2. M.E. Dyer and A.M. Frieze, “Probabilistic analysis of the multidimensional knapsack problem,”Mathematics of Operations Research (1989) 162–176.

  3. A.V. Goldberg and A. Marchetti-Spaccamela, “On finding the exact solution of a zero-one knapsack problem,” in:Proceedings of the 16th Annual ACM Symposium on the Theory of Computing (ACM Press, New York, 1984) pp. 359–368.

    Google Scholar 

  4. W. Hoeffding, “Probability inequalities for sums of bounded random variables,”Journal of the American Statistical Association (1963) 13–30.

  5. K.O. Jörnsten and M. Nasberg, “A new Lagrangian relaxation approach to the generalised assignment problem,”European Journal of Operations Research (1986) 313–323.

  6. G.S. Lueker, “On the average difference between the solutions to linear and integer knapsack problems,” in: R.L. Disney and T.J. Ott, eds.,Applied Probability-Computer Science: The Interface, Vol. I, Progress in Computer Science (Birkhäuser, Boston, MA, 1982) pp. 489–504.

    Google Scholar 

  7. C.J.H. McDiarmid, “On the method of bounded differences,” in: J. Siemons, ed.,Surveys in Combinatorics. London Mathematical Society Lecture Notes No.141 (1989) pp. 148–188.

    Google Scholar 

  8. G.T. Ross and R.M. Soland, “A branch-and-bound algorithm for the generalised assignment problem,”Mathematical Programming 8 (1975) 91–103.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Studies, University of Leeds, LS2 9YT, Leeds, UK

    Martin Dyer

  2. Department of Mathematics, Carnegie-Mellon University, 15213, Pittsburgh, PA, USA

    Alan Frieze

Authors
  1. Martin Dyer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alan Frieze
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Supported by NATO grant RG0088/89.

Supported by NSF grant CCR-8900112 and NATO grant RG0088/89.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dyer, M., Frieze, A. Probabilistic analysis of the generalised assignment problem. Mathematical Programming 55, 169–181 (1992). https://doi.org/10.1007/BF01581197

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01581197

Key words

Search

Navigation