Matteo Fortini

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
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(More)
  • 1