摘要：The travelling salesman problem (TSP) is a well‐known business problem, and variants like the maximumbenefit TSP or the price collecting TSP may have numerous economic applications. We are looking at severaldifferent variants of TSP; all solved in spreadsheets, not using tailored solvers for TSP. As these problems areNP hard, solving those using standard LP/MIP solvers has been regarded feasible only for very small sizedproblems. However, a careful consideration of the spreadsheet layout may facilitate efficient softwareutilisation. For real world problems this can have considerable effects, and with the recent advancements insolver engines, problems previously regarded as big are now easily solvable in spreadsheets. This papershows you how; and how the flexibility of spreadsheets makes it a convenient tool solving many variants ofTSP, where tailored solvers simply would not fit.
