Skip to main content
SpringerLink
Log in

On Very Large Scale Assignment Problems

  • Chapter
Large Scale Optimization

Abstract

In this paper we present computational testing results on very large scale random assignment problems. We consider a fully dense assignment problem with 2n nodes. Some conjectured or derived properties regarding fully dense assignment problems including the convergence of the optimal objective function value and the portion of nodes assigned with their kth best arc have been verified for networks up to n = 100,000 in size. Also we demonstrate the power of our approach in solving very large scale assignment problems by solving a one million node, one trillion arc random assignment problem.

This research is supported by grant AFOSR-88-0088 from the Air Force Office of Scientific Research, and by a grant from the United Parcel Service.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin (1993), Network Flows: Theory, Algorithms and Applications. Prentice Hall.

    MATH  Google Scholar 

  2. M. Akgul . (1990), A Forest Primal-dual Algorithm for the Assignment Problem. Bilkent University, Ankara, Turkey, Research Report: IEOR-9014, 0 (0): 1–2.

    Google Scholar 

  3. F. Avram and D. J. Bertsimas (1993), On a Characterization of the Minimum Assignment and Matching in the Independent Random Model. In The third Symposium in Integer Programming and Combinatorial Optimization, Enrice, Italy.

    Google Scholar 

  4. M. L. Balinski (1985), “Signature Methods for the Assignment Problem,” Operations Research 33 (3) 527–536.

    Article  MathSciNet  MATH  Google Scholar 

  5. D. P. Bertsekas (1990), “The Auction Algorithm for Assignment and other Network Flow Problems: A tutorial,” Interfaces 20 (4) 133–149.

    Google Scholar 

  6. D. J. Bertsimas 1993, Personal Communication.

    Google Scholar 

  7. H. N. Gabow and R. E. Tarjan (1989), “Faster Scaling Algorithms for Network Problems,” Siam Journal on Computing 18 (5) 1013–1036.

    Article  MathSciNet  MATH  Google Scholar 

  8. M. S. Hung (1983), “A Polynomial Simplex Method for the Assignment Problem,” Operations Research 31 (3) 595–600.

    Article  MathSciNet  MATH  Google Scholar 

  9. M. S. Hung and W. O. Rom (1980), “Solving the Assignment Problem by Relaxation,” Operations Research 28 (4) 969–982.

    Article  MathSciNet  MATH  Google Scholar 

  10. R. M. Karp (1980), “An Algorithm to solve the Mxn Assignment Problem in Expected Time 0 (mn log n),” Networks 10 143–152.

    Article  MathSciNet  MATH  Google Scholar 

  11. R. M. Karp (1984), An Upper Bound on the Expected Cost of an Optimal Assignment Technical Report, Computer Science Division, University of California, Berkeley.

    Google Scholar 

  12. J. Kennington and Z. Wang (1992), “A Shortest Augmenting Path Algorithm for the Semi-assignment Problem,” Operations Research 40 (1) 178–187.

    Article  MathSciNet  MATH  Google Scholar 

  13. Y. Lee and J. B. Orlin (1993), Quick Match: A Very Fast Algorithm for the Assignment Problem. Submitted to Mathematical Programming.

    Google Scholar 

  14. V. Lotfi (1989), “A Labeling Algorithm to solve the Assignment Problem,” Computers and Operations Research 16 (5) 397–408.

    Article  MATH  Google Scholar 

  15. G. M. Megson and D. J. Evans (1990), “A Systolic Array Solution for the Assignment Problem,” The Computer Journal 33 (6) 562–569.

    Article  MathSciNet  Google Scholar 

  16. M. Mezard and G. Parisi (1985), “Replicas and Optimization,” Journal de Physique Lettres 771–778.

    Google Scholar 

  17. B. Olin (1992), Asymptotic Properties of Random Assignment Problems. PhD thesis, Royal Institute of Technology, Stockholm, Sweden.

    Google Scholar 

  18. P. M. Pardalos and K. G. Ramakrishnan (1993), On the Expected Optimal Value of Random Assignment Problems: Experimental Results and Open Questions.

    Google Scholar 

  19. K. G. Ramakrishnan, N. K. Karmarkar, and A. P. Kamath (1992), An Approximate Dual Projective Algorithm for solving Assignment Problems. Technical Report 92–4, DIMACS.

    Google Scholar 

  20. M. G. C. Resende and G. Veiga (1992), Computational Investigation of an Interior Point Linear Programming Algorithm for Minimum Cost Network Flows. Technical Report 92–4, Dimacs.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Civil Engineering, Massachusetts Institute of Technology, Cambridge, MA, 02139, USA

    Yusin Lee

  2. Sloan School of Management, Massachusetts Institute of Technology, Cambridge, MA, 02139, USA

    James B. Orlin

Authors
  1. Yusin Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. James B. Orlin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Center for Applied Optimization, University of Florida, Gainesville, USA

    W. W. Hager , D. W. Hearn  & P. M. Pardalos ,  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Kluwer Academic Publishers

About this chapter

Cite this chapter

Lee, Y., Orlin, J.B. (1994). On Very Large Scale Assignment Problems. In: Hager, W.W., Hearn, D.W., Pardalos, P.M. (eds) Large Scale Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-3632-7_12

Download citation

  • DOI: https://doi.org/10.1007/978-1-4613-3632-7_12

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-3634-1

  • Online ISBN: 978-1-4613-3632-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation