Imagem da capa

In pursuit of the traveling salesman mathematics at the limits of computation /

"What is the shortest possible route for a traveling salesman seeking to visit each city on a list exactly once and return to his city of origin? It sounds simple enough, yet the traveling salesman problem is one of the most intensely studied puzzles in applied mathematics--and it has defied so...

ver descrição completa

Na minha lista:
Detalhes bibliográficos
Autor principal: Cook, William, 1957-
Autor Corporativo: ebrary, Inc
Formato: Recurso Eletrônico livro eletrônico
Idioma:inglês
Publicado em: Princeton : Princeton University Press, 2012.
Assuntos:
Traveling salesman problem.
Computational complexity.
Electronic books.
Acesso em linha:An electronic book accessible through the World Wide Web; click to view
Tags: Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!

Registros relacionados

Registros relacionados