| Article ID: | iaor20042339 |
| Country: | United States |
| Volume: | 45 |
| Issue: | 1 |
| Start Page Number: | 116 |
| End Page Number: | 123 |
| Publication Date: | Mar 2003 |
| Journal: | SIAM Review |
| Authors: | Pataki Gbor |
| Keywords: | programming: geometric |
We designed a simple computational exercise to compare weak and strong integer programming formulations of the traveling salesman problem. Using commercial IP software, and a short (60 line long) MATLAB code, students can optimally solve instances with up to 70 cities in a few minutes by adding cuts from the stronger formulation to the weaker, but simpler one.