Simulated annealing approach to verify vertex adjacencies in the traveling salesperson polytope

DOI10.1007/978-3-030-22629-9_26zbMath1444.90101arXiv1901.09651OpenAlexW2953563151MaRDI QIDQ2181774

Andrei Nikolaev, Anna Kozlova

Publication date: 19 May 2020

Full work available at URL: https://arxiv.org/abs/1901.09651

zbMATH Keywords

simulated annealingperfect matching1-skeletonvertex adjacencyHamiltonian tourtraveling salesperson problemtraveling salesperson polytopevertex-disjoint cycle cover

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (2)

Hamiltonian decomposition and verifying vertex adjacency in 1-skeleton of the traveling salesperson polytope by variable neighborhood search ⋮ Backtracking Algorithms for Constructing the Hamiltonian Decomposition of a 4-regular Multigraph

This page was built for publication: Simulated annealing approach to verify vertex adjacencies in the traveling salesperson polytope