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


Improved approximations for TSP with simple precedence constraints
Institution:1. Department of Computer Science, ETH Zurich, Switzerland;2. Department of Computer Science, Saarland University, Saarbrücken, Germany
Abstract:
Keywords:Ordered TSP  Traveling salesman problem  Approximation  Relaxed triangle inequality
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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