.png){kind=icon}
.png){kind=icon}
Return
Teaching integer programming formulations using the traveling salesman problem
.png){kind=icon}
OA
AI
DOI：10.1137/S00361445023685.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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 lip to 70 cities in a few minutes by adding cuts from the stronger formulation to the weaker, but simpler one.
Keywords:
integer programming
traveling salesman problem
subtour elimination constraints
cutting planes
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.