Complexity indices for the travelling salesman problem and data mining
In this survey paper we extend our previous work on complexity indices for the travelling salesman problem (TSP), summarized in cite{CvCK3}, using graph spectral techniques of data mining. A complexity index is an invariant of an instance $I$ by which we can predict the execution time of an exact al...
Main Author: | |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Isfahan
2012-03-01
|
Series: | Transactions on Combinatorics |
Subjects: | |
Online Access: | http://www.combinatorics.ir/?_action=showPDF&article=723&_ob=a83c593b06f18b6cdb9a9a465d56305d&fileName=full_text.pdf |