LCS Technical Memos (1974 - 2003): Recent submissions
Now showing items 307-309 of 486
-
The Traveling Saleman Problem with Many Visits to Few Cities
(1981-11)We study the version of the traveling salesman problem in which a relatively small number of cities -- say, six -- must be visited a huge number of times -- e.g., several hundred times each. )It costs to go from one city ... -
Optimal Placement for River Routing
(1981-10)Programs for integrated circuit layout typically have two phases: placement and routing. The router should produce as efficient a layout as possible, but of course the quality of the routhing depends heavily on the quality ...


