| dc.creator |
Shapiro, Jeremy F., 1939- |
|
| dc.date |
2004-05-28T19:27:40Z |
|
| dc.date |
2004-05-28T19:27:40Z |
|
| dc.date |
1989-11 |
|
| dc.date.accessioned |
2013-10-09T02:38:23Z |
|
| dc.date.available |
2013-10-09T02:38:23Z |
|
| dc.date.issued |
2013-10-09 |
|
| dc.identifier |
http://hdl.handle.net/1721.1/5199 |
|
| dc.identifier.uri |
http://koha.mediu.edu.my:8181/xmlui/handle/1721 |
|
| dc.description |
A constructive method is presented for optimizing exactly the Traveling Salesman Problem as a sequence of shortest route problems. The method combines group theoretic and Lagrangean relaxation constructions. Key Words: Traveling Salesman Problem, Lagrangean relaxation, shortest route problem, generalized linear programming, group theory. |
|
| dc.format |
1744 bytes |
|
| dc.format |
879422 bytes |
|
| dc.format |
application/pdf |
|
| dc.language |
en_US |
|
| dc.publisher |
Massachusetts Institute of Technology, Operations Research Center |
|
| dc.relation |
Operations Research Center Working Paper;OR 204-89 |
|
| dc.title |
Convergent Duality for the Traveling Salesman Problem |
|
| dc.type |
Working Paper |
|