Using DP-constraints to obtain improved TSP solutions.
The Travelling Salesman Problem (TSP) is a well-known NP-hard problem. Although it is unlikely that an efficient algorithm will ever be found for the TSP, some success has been achieved for large real-world instances by using the branch and cut technique. This technique requires knowledge of classes...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Published: |
University of Ottawa (Canada)
2009
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10393/6395 http://dx.doi.org/10.20381/ruor-14818 |