This chapter is devoted to the Traveling Salesman Problem (TSP), one of the most famous problems of combinatorial optimization. Compact ILP models for this problem have been proposed since a long time, but most of them are not effective for computational purposes. We describe an effective compact model which expresses the subtour inequalities via the max-flow/min-cut theorem. In this chapter we also present a new formulation for the TSP that shows some flexibility to be adapted to some TSP variants such as, in particular, the TSP with time windows.
CITATION STYLE
Lancia, G., & Serafini, P. (2018). Traveling Salesman Problems. In EURO Advanced Tutorials on Operational Research (pp. 155–164). Springer Nature. https://doi.org/10.1007/978-3-319-63976-5_12
Mendeley helps you to discover research relevant for your work.