Computing the integrality gap of the asymmetric travelling salesman problem
暂无分享,去创建一个
[1] ScienceDirect. Electronic notes in discrete mathematics , 1999 .
[2] Robert D. Carr,et al. Towards a 4/3 approximation for the asymmetric traveling salesman problem , 1999, SODA '00.
[3] Sylvia C. Boyd,et al. Finding the Exact Integrality Gap for Small Traveling Salesman Problems , 2002, IPCO.
[4] Alan M. Frieze,et al. On the worst-case performance of some algorithms for the asymmetric traveling salesman problem , 1982, Networks.
[5] Santosh S. Vempala,et al. A convex relaxation for the asymmetric TSP , 1999, SODA '99.
[6] David P. Williamson,et al. Analyzing the Held-Karp TSP Bound: A Monotonicity Property with Application , 1990, Inf. Process. Lett..
[7] L. Wolsey. Heuristic analysis, linear programming and branch and bound , 1980 .
[8] Michel X. Goemans,et al. On the integrality ratio for asymmetric TSP , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[9] Sebastian Raaphorst. Branch-and-cut for symmetrical ILPs and combinatorial designs , 2004 .