![Graph theory / Mathematics / Computational complexity theory / NP-complete problems / Graph / Travelling salesman problem / Vertex / Cycle / Hamiltonian path / Graph automorphism / Vertex cover Graph theory / Mathematics / Computational complexity theory / NP-complete problems / Graph / Travelling salesman problem / Vertex / Cycle / Hamiltonian path / Graph automorphism / Vertex cover](https://www.pdfsearch.io/img/57805ac8365dd566534644329f10297f.jpg) Date: 2013-06-19 04:16:58Graph theory Mathematics Computational complexity theory NP-complete problems Graph Travelling salesman problem Vertex Cycle Hamiltonian path Graph automorphism Vertex cover | | TSPLIB in XML format To facilitate the usage of the classical TSPLIB by Gerhard Reinelt, we now offer the data of the well-known test instances also in an XML data format, both for the symmetric and the asymmetric travelAdd to Reading ListSource URL: www.iwr.uni-heidelberg.deDownload Document from Source Website File Size: 45,42 KBShare Document on Facebook
|