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

An Analysis of Approximations for Finding a Maximum Weight Hamiltonian Circuit

Author

Listed:
  • M. L. Fisher

    (University of Pennsylvania, Philadelphia, Pennsylvania)

  • G. L. Nemhauser

    (Cornell University, Ithaca, New York)

  • L. A. Wolsey

    (University of Louvain, Louvain-La-Neuve, Belgium)

Abstract

We give bounds on heuristics and relaxations for the problem of determining a maximum weight hamiltonian circuit in a complete, undirected graph with non-negative edge weights. Three well-known heuristics are shown to produce a tour whose weight is at least half of the weight of an optimal tour. Another heuristic, based on perfect two-matchings, is shown to produce a tour whose weight is at least two-thirds of the weight of an optimal tour. Assignment and perfect two-matching relaxations are shown to produce upper bounds that are, respectively, at most 2 and 3/2 times the optimal value. By defining a more general measure of performance, we extend the results to arbitrary edge weights and minimization problems. We also present analogous results for directed graphs.

Suggested Citation

  • M. L. Fisher & G. L. Nemhauser & L. A. Wolsey, 1979. "An Analysis of Approximations for Finding a Maximum Weight Hamiltonian Circuit," Operations Research, INFORMS, vol. 27(4), pages 799-809, August.
    • Handle: RePEc:inm:oropre:v:27:y:1979:i:4:p:799-809
    DOI: 10.1287/opre.27.4.799
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.27.4.799
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.27.4.799?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
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Paul Dütting & Thomas Kesselheim & Éva Tardos, 2021. "Algorithms as Mechanisms: The Price of Anarchy of Relax and Round," Mathematics of Operations Research, INFORMS, vol. 46(1), pages 317-335, February.
    2. Monnot, Jerome, 2005. "Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s)," European Journal of Operational Research, Elsevier, vol. 161(3), pages 721-735, March.
    3. Marshall L. Fisher, 2004. "The Lagrangian Relaxation Method for Solving Integer Programming Problems," Management Science, INFORMS, vol. 50(12_supple), pages 1861-1871, December.

    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:27:y:1979:i:4:p:799-809. 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.