Traveling salesman path problems
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2005. === Includes bibliographical references (p. 153-155). === In the Traveling Salesman Path Problem, we are given a set of cities, traveling costs between city pairs and fixed source and destination cities. The objectiv...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | English |
| Published: |
Massachusetts Institute of Technology
2006
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/33668 |