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 solutio...

पूर्ण विवरण

ग्रंथसूची विवरण

मुख्य लेखक:	Cook, William, 1957-
निगमित लेखक:	ebrary, Inc
स्वरूप:	इलेक्ट्रोनिक ई-पुस्तक
भाषा:	अंग्रेज़ी
प्रकाशित:	Princeton : Princeton University Press, 2012.
विषय:	Traveling salesman problem. Computational complexity. Electronic books.
ऑनलाइन पहुंच:	An electronic book accessible through the World Wide Web; click to view
टैग:	टैग जोड़ें कोई टैग नहीं, इस रिकॉर्ड को टैग करने वाले पहले व्यक्ति बनें!