IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v26y1978i5p718-759.html
   My bibliography  Save this article

Combinatorial Problems: Reductibility and Approximation

Author

Listed:
  • Sartaj Sahni

    (University of Minnesota, Minneapolis, Minnesota)

  • Ellis Horowitz

    (University of Southern California, Los Angeles, California)

Abstract

Recent research in the theory of algorithms has determined that many classical operations research problems are computationally related; i.e., an efficient algorithm for one implies the existence of efficient algorithms for everyone or a proof that one is inherently difficult implies they are all so. This paper presents a tutorial of this concept. In contrast to other surveys it does so by selecting a few problems (knapsack, traveling salesperson, multiprocessor scheduling, and flow shop) and carefully shows how they are related. References to most other problems of interest to operations researchers are given. The second part of this paper is a survey on the relatively recent progress in the study of approximation algorithms. These algorithms hold great promise for they work fast and in many cases are guaranteed to work well. Again the techniques for devising and analyzing these algorithms are explained through the continued use of these examples.

Suggested Citation

  • Sartaj Sahni & Ellis Horowitz, 1978. "Combinatorial Problems: Reductibility and Approximation," Operations Research, INFORMS, vol. 26(5), pages 718-759, October.
    • Handle: RePEc:inm:oropre:v:26:y:1978:i:5:p:718-759
    DOI: 10.1287/opre.26.5.718
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.26.5.718
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.26.5.718?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:26:y:1978:i:5:p:718-759. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.