Comparison of the Sub-Tour Elimination Methods for the Asymmetric Traveling Salesman Problem Applying the SECA Method
There are many sub-tour elimination constraint (SEC) formulations for the traveling salesman problem (TSP). Among the different methods found in articles, usually three apply more than others. This study examines the Danzig–Fulkerson–Johnson (DFJ), Miller–Tucker–Zemlin (MTZ), and Gavish–Graves (GG)...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2021-02-01
|
| Series: | Axioms |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2075-1680/10/1/19 |