<abstract xmlns="http://www.w3.org/1999/xhtml"><p>This paper includes an introduction to the concept of spreadsheet optimization and modeling as it specifically applies to combinatorial problems. One of the best known of the classic combinatorial problems is the “Traveling Salesman Problem” (TSP). The classic Traveling Salesman Problem has the objective of minimizing some value, usually distance, while defining a sequence of locations where each is visited once. An additional requirement is that the tour ends in the same location where the tour started. Variants of the classic Traveling Salesman Problem are developed including the Bottleneck TSP and the Variation Bottleneck TSP.</p></abstract>

This paper includes an introduction to the concept of spreadsheet optimization and modeling as it specifically applies to combinatorial problems. One of the best known of the classic combinatorial problems is the “Traveling Salesman Problem” (TSP). The classic Traveling Salesman Problem has the objective of minimizing some value, usually distance, while defining a sequence of locations where each is visited once. An additional requirement is that the tour ends in the same location where the tour started. Variants of the classic Traveling Salesman Problem are developed including the Bottleneck TSP and the Variation Bottleneck TSP.

Variants of the Traveling Salesman Problem

Studies in Business and Economics

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

{"article-title":"Variants of the Traveling Salesman Problem"}

This paper includes an introduction to the concept of spreadsheet optimization and modeling as it specifically applies to combinatorial problems. One of the...

Variants of the Traveling Salesman Problem

Data publikacji: 16 maj 2019

Zakres stron: 208 - 220

DOI: https://doi.org/10.2478/sbe-2019-0016

Słowa kluczowe
Optimization, Spreadsheet, Traveling Salesman, Combinatorial

© 2019 Mike Patterson et al., published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

Variants of the Traveling Salesman Problem

Data publikacji: 16 maj 2019

Zakres stron: 208 - 220

DOI: https://doi.org/10.2478/sbe-2019-0016

Słowa kluczoweOptimization, Spreadsheet, Traveling Salesman, Combinatorial

© 2019 Mike Patterson et al., published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

Słowa kluczowe
Optimization, Spreadsheet, Traveling Salesman, Combinatorial