|
|||||
|
|
A new upper bound for the traveling salesman problem in cubic graphs |
|
| Affiliation: | Institut für Theoretische Informatik, Universität zu Lübeck, Ratzeburger Allee 160, 23538 Lübeck, Germany |
| Abstract: | |
| Keywords: | Exact algorithms Traveling salesman problem Cubic graphs Hamiltonian cycle |
| 本文献已被 ScienceDirect 等数据库收录！ | |