2 papers
math.CO2020
Hamiltonian decomposition and verifying vertex adjacency in 1-skeleton of the traveling salesperson polytope by variable neighborhood search
Andrei Nikolaev, Anna Kozlova
We consider a Hamiltonian decomposition problem of partitioning a regular graph into edge-disjoint Hamiltonian cycles. A sufficient condition for vertex adjacency in the 1-skeleton…
math.CO2019
Simulated annealing approach to verify vertex adjacencies in the traveling salesperson polytope
Anna Kozlova, Andrei Nikolaev
We consider 1-skeletons of the symmetric and asymmetric traveling salesperson polytopes whose vertices are all possible Hamiltonian tours in the complete directed or undirected gra…