Refine
Document Type
- Article (2)
Language
- English (2)
Has Fulltext
- yes (2)
Keywords
- Software (1)
- Theoretical Computer Science (1)
We consider the following natural heuristic for the Symmetric Traveling Salesman Problem: solve the subtour relaxation, yielding a solution x?, and then find the best tour ¯ x that is compatible with x?, where compatible means that every subtour elimination constraint that is satisfied at equality at x? is also satisfied at equality at ¯ x. We prove that finding the best compatible tour is NP-hard and show that the tour can have a cost approaching 5/3 that of the optimal tour. We then describe a branch-and-cut algorithm for computing the best compatible tour, and present extensive computational results for TSPLIB instances. It turns out that, in practice, the tour is usually of very good quality. Moreover, the computational effort for computing the compatible tour is considerably smaller than that of solving the full problem with the best available software, i.e., Concorde.
The Clique Partitioning Problem is a fundamental and much-studied N P-hard combi-
natorial optimisation problem, with many applications. Several families of benchmark
instances have been created in the past, but they are scattered across the literature and
hard to find. To remedy this situation, we present CP-Lib, an online resource that
contains most of the known instances, plus some challenging new ones.