A note on using the resistance-distance matrix to solve Hamiltonian cycle problem

V. Ejov (), J. A. Filar (), M. Haythorpe (), J. F. Roddick () and S. Rossomakhine ()
Additional contact information
V. Ejov: Flinders University
J. A. Filar: University of Queensland
M. Haythorpe: Flinders University
J. F. Roddick: Flinders University
S. Rossomakhine: Flinders University

Annals of Operations Research, 2018, vol. 261, issue 1, No 17, 393-399

Abstract: Abstract An instance of Hamiltonian cycle problem can be solved by converting it to an instance of Travelling salesman problem, assigning any choice of weights to edges of the underlying graph. In this note we demonstrate that, for difficult instances, choosing the edge weights to be the resistance distance between its two incident vertices is often a good choice. We also demonstrate that arguably stronger performance arises from using the inverse of the resistance distance. Examples are provided demonstrating benefits gained from these choices.

Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10479-017-2571-7 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:spr:annopr:v:261:y:2018:i:1:d:10.1007_s10479-017-2571-7

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-017-2571-7

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().