Kahng Andrew B.

Andrew B. Kahng

Information about the author Andrew B. Kahng will soon be added to the site.
Found 6 papers in total
Match twice and stitch: a new traveling salesman problem tour construction heuristic
Match twice and stitch: a new traveling salesman problem tour construction heuristic
2004
We present a new symmetric traveling salesman problem tour construction heuristic. Two...
How to test a tree
How to test a tree
1998
We address the problem of verifying that a tree is connected using probe operations...
Improved large-step Markov chain variants for the symmetric TSP
Improved large-step Markov chain variants for the symmetric TSP
1997
The large-step Markov chain (LSMC) approach is the most effective known heuristic for...
Spectral partitioning with multiple eigenvectors
Spectral partitioning with multiple eigenvectors
1999
The graph partitioning problem is to divide the vertices of a graph into disjoint...
Old Bachelor Acceptance: A new class of non-monotone threshold accepting methods
Old Bachelor Acceptance: A new class of non-monotone threshold accepting methods
1995
Stochastic hill-climbing algorithms, particularly simulated annealing (SA) and...
A new adaptive multi-start technique for combinatorial global optimizations
A new adaptive multi-start technique for combinatorial global optimizations
1994
The authors analyze relationships among local minima for the traveling salesman and...
Papers per page: