| dc.contributor.author | Shapiro, Jeremy F., 1939- | en_US |
| dc.date.accessioned | 2004-05-28T19:27:40Z | |
| dc.date.available | 2004-05-28T19:27:40Z | |
| dc.date.issued | 1989-11 | en_US |
| dc.identifier.uri | http://hdl.handle.net/1721.1/5199 | |
| dc.description.abstract | 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. | en_US |
| dc.format.extent | 1744 bytes | |
| dc.format.extent | 879422 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Massachusetts Institute of Technology, Operations Research Center | en_US |
| dc.relation.ispartofseries | Operations Research Center Working Paper;OR 204-89 | en_US |
| dc.title | Convergent Duality for the Traveling Salesman Problem | en_US |
| dc.type | Working Paper | en_US |
| dc.contributor.department | Massachusetts Institute of Technology. Operations Research Center | |
