‘In this paper we give theorems which strongly suggest, but do not ‘I conjecture that there is no good algorithm for the traveling Problem-which has long defied solution by man, or by the fastestįact, there may well be no general method for treating the problemĪnd impossibility results would also be valuable.’ Mathematical problem-the “ Traveling Salesman” It grew out of the trio’s efforts to find solutions for a classic I am grateful for their continuedįinally, I thank my family, Monika, Benny, and Linda, for years of My work on the traveling salesman problem isįunded by grants from the National Science Foundation (CMMI-0726370)Īnd the Office of Naval Research (N0-0048), and by a generousĮndowment from A. Stewart School of Industrial and Systems Engineering at Georgia TechĪnd the Department of Operations Research and Financial EngineeringĪt Princeton University. In pursuit of the traveling salesman : mathematics at the limits of computation / William J. Library of Congress Cataloging-in-Publication Data In the United Kingdom: Princeton University Press, 6 Oxford Street, Published by Princeton University Press, 41 William Street, In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation
0 Comments
Leave a Reply. |