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

Technical Note—Data-Dependent Bounds for Heuristics to Find a Minimum Weight Hamiltonian Circuit

Author

Listed:
  • Roy Jonker

    (Universiteit van Amsterdam, The Netherlands)

  • Rob Kaas

    (Universiteit van Amsterdam, The Netherlands)

  • Ton Volgenant

    (Universiteit van Amsterdam, The Netherlands)

Abstract

We consider the problem of finding a minimum weight Hamiltonian circuit in a weighted undirected graph. If the edge weights are non-negative and satisfy the triangle inequality, there are heuristics for this problem known to have data-independent bounds on their performance. We derive data-dependent bounds for these heuristics for arbitrary edge weight problems. Our approach leads to sharper bounds than the data-independent ones when the data is non-negative and satisfies the triangle inequality.

Suggested Citation

  • Roy Jonker & Rob Kaas & Ton Volgenant, 1980. "Technical Note—Data-Dependent Bounds for Heuristics to Find a Minimum Weight Hamiltonian Circuit," Operations Research, INFORMS, vol. 28(5), pages 1219-1222, October.
    • Handle: RePEc:inm:oropre:v:28:y:1980:i:5:p:1219-1222
    DOI: 10.1287/opre.28.5.1219
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.28.5.1219
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.28.5.1219?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:28:y:1980:i:5:p:1219-1222. 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.