首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Certification of an optimal TSP tour through 85,900 cities
Authors:David L Applegate  Daniel G Espinoza
Institution:a AT&T Labs - Research, United States
b Graduate School of Management, Rice University, United States
c Department of Computer Science and Software Engineering, Concordia University, Canada
d School of Industrial and Systems Engineering, Georgia Tech, Atlanta, GA, 30332, United States
e Departamento de Ingeniería Industrial, Universidad de Chile, Chile
f School of Business, Universidad Adolfo Ibáñez, Chile
g Department of Computer Science, Roskilde University, Denmark
Abstract:We describe a computer code and data that together certify the optimality of a solution to the 85,900-city traveling salesman problem pla85900, the largest instance in the TSPLIB collection of challenge problems.
Keywords:Traveling salesman problem  Integer programming  Linear programming
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号