A new heuristic for detecting non-hamiltonicity in cubic graphs
Year of publication: |
2014
|
---|---|
Authors: | Filar, Jerzy A. ; Haythorpe, Michael ; Rossomakhine, Serguei |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 64.2015, p. 283-292
|
Subject: | Hamiltonian cycles | Linear feasibility | Traveling salesman problem | Polyhedra | Heuristik | Heuristics | Rundreiseproblem | Travelling salesman problem | Graphentheorie | Graph theory | Tourenplanung | Vehicle routing problem |
-
Layers and matroids for the traveling salesman's paths
Schalekamp, Frans, (2018)
-
Becker, Kai Helge, (2015)
-
Basu, Sumanta, (2013)
- More ...
-
Refined MDP-based branche-and-fix algorithm for the Hamiltonian cycle problem
Ejov, Vladimir, (2009)
-
A hybrid simulation-optimization algorithm for the Hamiltonian cycle problem
Eshragh, Ali, (2011)
-
Genetic Theory for Cubic Graphs
Baniasadi, Pouya, (2016)
- More ...