| Article ID: | iaor19972163 |
| Country: | Portugal |
| Volume: | 16 |
| Issue: | 2 |
| Start Page Number: | 89 |
| End Page Number: | 114 |
| Publication Date: | Dec 1996 |
| Journal: | Investigao Operacional |
| Authors: | Gouveia Lus |
Several formulations for the Traveling Salesman Problem are compared with respect to their Linear Programming (LP) relaxations. In particular, the authors present a survey of several techniques used for tightening the LP relaxation of a given model.