On the asymptotic behavior of subtour-patching heuristics in solving the TSP on permuted Monge matrices.
Vladimir G. DeinekoDvir ShabtayGeorge SteinerPublished in: J. Heuristics (2011)
Keyphrases
- combinatorial optimization
- traveling salesman problem
- systems of linear equations
- subtour elimination
- timetabling problem
- search heuristics
- singular value decomposition
- heuristic solution
- variable ordering
- travelling salesman
- genetic algorithm
- search algorithm
- search space
- heuristic methods
- resource constrained project scheduling problem
- eigenvalue problems