Generating subtour elimination constraints for the TSP from pure integer solutions

The traveling salesman problem (TSP) is one of the most prominent combinatorial optimization problems. Given a complete graph [Formula: see text] and non-negative distances d for every edge, the TSP asks for a shortest tour through all vertices with respect to the distances d. The method of choice f...

Descripción completa

Detalles Bibliográficos
Autores principales: Pferschy, Ulrich, Staněk, Rostislav
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Springer Berlin Heidelberg 2016
Materias:
Original Paper
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5480099/
https://www.ncbi.nlm.nih.gov/pubmed/28690424
http://dx.doi.org/10.1007/s10100-016-0437-8

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5480099/
https://www.ncbi.nlm.nih.gov/pubmed/28690424
http://dx.doi.org/10.1007/s10100-016-0437-8

Ejemplares similares