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

Roy Jonker, Rob Kaas and Ton Volgenant
Additional contact information
Roy Jonker: Universiteit van Amsterdam, The Netherlands
Rob Kaas: Universiteit van Amsterdam, The Netherlands
Ton Volgenant: Universiteit van Amsterdam, The Netherlands

Operations Research, 1980, vol. 28, issue 5, 1219-1222

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.

Date: 1980
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.28.5.1219 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:28:y:1980:i:5:p:1219-1222

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().