scientific article

zbMath1276.90078MaRDI QIDQ2863912

Federico Greco, Ivan Gerace

Publication date: 4 December 2013

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571066107000497?np=y

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

computational complexitytraveling salesman problemcirculant weighted undirected graphs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

The two-stripe symmetric circulant TSP is in P ⋮ Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting) ⋮ Characterizing the Integrality Gap of the Subtour LP for the Circulant Traveling Salesman Problem

This page was built for publication: