The maximum travelling salesman problem on symmetric Demidenko matrices
Proceedings of the 5th Twente workshop on on Graphs and combinatorial optimization
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Four point conditions and exponential neighborhoods for symmetric TSP
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
One-Sided monge TSP is NP-Hard
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
A new asymmetric pyramidally solvable class of the traveling salesman problem
Operations Research Letters
Hi-index | 0.04 |