Research Catalog
New! Try our Article Search to discover online journals, books, and more from home with your library card.
Displaying 1-13 of 13 results
A traveling-salesman-based approach to aircraft scheduling in the terminal area [microform] / Robert A. Luenberger.
- Text
- Moffett Field, Calif. : National Aeronautics and Space Administration, Ames Research Center ; [Springfield, Va. : National Technical Information Service, distributor, 1988]
- 1988
Les problèmes de tournées : un algorithme pour le cas monovehicule avec restrictions temporelles et de précedence / Guy Keymolen.
- Text
- Louvain-la-Neuve : Academia, 1988.
- 1988
- 1 Item
Item details Format Call Number Item Location Text ReCAP 12-33182 Schwarzman Building - General Research Room 315 Available - Can be used on site. Please visit New York Public Library - Schwarzman Building to submit a request in person.
In pursuit of the traveling salesman : mathematics at the limits of computation / William J. Cook.
- Text
- Princeton, N.J. : Princeton University Press, c2012.
- 2012
- 1 Item
Item details Format Call Number Item Location Text JBE 16-438 Schwarzman Building - General Research Room 315 Available - Can be used on site. Please visit New York Public Library - Schwarzman Building to submit a request in person.
Approximation algorithms for traveling salesman problems / Vera Traub, Jens Vygen.
- Text
- Cambridge ; New York, NY : Cambridge University Press, 2025.
- 2025-2025
- 1 Resource
Available Online
https://doi.org/10.1017/9781009445436Algorithms for the solution of the optimal cost and bottleneck travelling salesman problems / by Donald M. Shapiro.
- Text
- 1966.
- 1966
- 1 Item
Item details Format Call Number Item Location Text F 8507 Off-site The traveling salesman : computational solutions for TSP applications / Gerhard Reinelt.
- Text
- Berlin ; New York : Springer-Verlag, [1994], ©1994.
- 1994-1994
- 1 Item
Item details Format Call Number Item Location Text T57.78 .R47 1994 Off-site Das quadratische Zuweisungsproblem und zwei seiner Spezialfälle.
- Text
- Tübingen : Mohr <Siebeck>, 1971.
- 1971
- 1 Item
Item details Format Call Number Item Location Text T57.82 .C65 Off-site The traveling salesman problem and its variations / edited by Gregory Gutin and Abraham P. Punnen.
- Text
- Dordrecht ; Boston : Kluwer Academic Publishers, [2002], ©2002.
- 2002-2002
- 1 Item
Item details Format Call Number Item Location Text QA164 .T733 2002 Off-site The State of the art in the routing and scheduling of vehicles and crews / by Lawrence Bodin [and others].
- Text
- Washington, D.C. : Office of Policy Research and the Office of Technical Assistance, Urban Mass Transportation Administration, U.S. Department of Transportation ; Springfield, Va. : National Technical Information Service, 1981.
- 1981
- 1 Item
Item details Format Call Number Item Location Text TD 7.2:R 76 Off-site The Traveling salesman problem : a guided tour of combinatorial optimization / edited by E.L. Lawler [and others].
- Text
- Chichester [West Sussex] ; New York : Wiley, [1985], ©1985.
- 1985-1985
- 1 Item
Item details Format Call Number Item Location Text QA164 .T73 1985 Off-site The traveling salesman problem : a computational study / David L. Applegate [and others].
- Text
- Princeton : Princeton University Press, [2006], ©2006.
- 2006-2006
- 2 Items
Item details Format Call Number Item Location Text Off-site Not available - Please for assistance.Item details Format Call Number Item Location Text QA164 .T72 2006g Off-site Special cases of the traveling salesman problem / door Ireneus Cornelis van Dal.
- Text
- Groningen : Wolters-Noordhoff, c1992.
- 1992
- 1 Item
Item details Format Call Number Item Location Text HB143.7 .D25x Off-site Les problèmes de tournées : un algorithme pour le cas monovehicule avec restrictions temporelles et de précedence / Guy Keymolen.
- Text
- Louvain-la-Neuve : Academia, 1988.
- 1988
- 1 Item
Item details Format Call Number Item Location Text QA402.5 .K49 Off-site
No results found from Digital Research Books Beta
Digital books for research from multiple sources world wide- all free to read, download, and keep. No Library Card is Required. Read more about the project.
