Skip to main content
SpringerLink
Log in

Worst-case analysis of the differencing method for the partition problem

  • Published:
Mathematical Programming Submit manuscript

Abstract

We prove that the worst-case performance ratio of the Karmarkar-Karp differencing method for the Partition Problem is 7/6

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. M.R. Garey and D.S. Johnson,Computers and Intractability: a Guide to the Theory of NP-Completeness (Freeman, San Francisco, 1979).

    Google Scholar 

  2. N. Karmarkar and R.M. Karp, “The differencing method of set partitioning,”Mathematics of Operations Research (to appear).

Download references

Author information

Authors and Affiliations

  1. Deis, University of Bologna, Bologna, Italy

    Matteo Fischetti & Silvano Martello

Authors
  1. Matteo Fischetti
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Silvano Martello
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fischetti, M., Martello, S. Worst-case analysis of the differencing method for the partition problem. Mathematical Programming 37, 117–120 (1987). https://doi.org/10.1007/BF02591687

Download citation

  • Received:

  • Issue Date:

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

Key words

Search

Navigation