Quasiabelian landscapes of the traveling salesman problem are elementary
type: Item
instance of: scholarly article
title: Quasiabelian landscapes of the traveling salesman problem are elementary
zbMATH Open document ID: 1167.90635
author: Andrew Solomon
author: B. W. Colletti
published in: Discrete Optimization
publication date: 2009-08-19T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 5596686
zbMATH Keywords: traveling salesman problem
zbMATH Keywords: TSP
zbMATH Keywords: permutation
zbMATH Keywords: group representation
zbMATH Keywords: landscape
zbMATH Keywords: elementary
zbMATH Keywords: eigenvector
zbMATH Keywords: eigenvalue
zbMATH Keywords: quasiabelian
MaRDI profile type: Publication
full work available at URL: j.disopt.2009.02.001
OpenAlex ID: W2043023583
cites work: Computer Solutions of the Traveling Salesman Problem
cites work: Local search and the local structure of NP-complete problems
cites work: Traveling salesman problem and local search
cites work: The theory of elementary landscapes
cites work: Weakly symmetric graphs, elementary landscapes, and the TSP
cites work: Linearity in the traveling salesman problem
cites work: Local search structure in the symmetric travelling salesperson problem under a general class of rearrangement neighborhoods
cites work: Q4317890
cites work: On quasiabelian Cayley graphs and graphical doubly regular representations
cites work: Laplacian eigenvectors of graphs. Perron-Frobenius and Faber-Krahn type theorems
DOI: 10.1016/J.DISOPT.2009.02.001
description: scientific article; zbMATH DE number 5596686