The latest issue of INFORMS Journal on Computing is out. See the link below. The first two papers of this issue are our first two Meritorious Paper awardees. We also announce the The Test of Time Award for papers published in the INFORMS Journal on Computing in the years 2001–2005, which is awarded to the following:David Applegate, William Cook, and Andre Rohe ´Chained Lin-Kernighan for Large Traveling Salesman ProblemsINFORMS Journal on Computing (2003) 15(1):82–92Chained Lin-Kernighan for Large Traveling Salesman Problems
Informs |
remove preview |
|
Chained Lin-Kernighan for Large Traveling Salesman Problems |
We discuss several issues that arise in the implementation of Martin, Otto, and Felten's Chained Lin-Kernighan heuristic for large-scale traveling salesman problems. Computational results are presented for TSPLIB instances ranging in size from 11,849 cities up to 85,900 cities; for each of these instances, solutions within 1% of the optimal value can routinely be found in under one CPU minute on a 300 MHz Pentium II workstation, and solutions within 0.5% of optimal can routinely be found in under ten CPU minutes. |
View this on Informs > |
|
|
INFORMS Journal on Computing - Volume: 33, Number: 2 (Spring 2021)
The current issue of INFORMS Journal on Computing is now available online at:
INFORMS Journal on Computing: Vol 33, No 2
Informs |
remove preview |
|
INFORMS Journal on Computing: Vol 33, No 2 |
If you have an individual subscription to this content, or if you have purchased this content through Pay Per Article within the past 24 hours, you can gain access by logging in with your username and password here: |
View this on Informs > |
|
|
http://pubsonline.informs.org/toc/ijoc/33/2
------------------------------
Alice Smith
Editor in Chief, INFORMS Journal on Computing
Forehand/Accenture Distinguished Professor
Auburn University
Auburn AL
------------------------------