| Article ID: | iaor19912103 |
| Country: | Netherlands |
| Volume: | 10 |
| Issue: | 3 |
| Start Page Number: | 129 |
| End Page Number: | 136 |
| Publication Date: | Apr 1991 |
| Journal: | Operations Research Letters |
| Authors: | Shapiro Jeremy F. |
| Keywords: | programming: travelling salesman |
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.