Publisher
Springer Science and Business Media LLC
Subject
Geometry and Topology,Theoretical Computer Science,Software
Reference35 articles.
1. Applegate DL, Bixby RE, Chvatal V, Cook WJ (2011) The traveling salesman problem: a computational study. Princeton University Press, Princeton
2. Ascheuer N, Jünger M, Reinelt G (2000) A branch and cut algorithm for the asymmetric traveling salesman problem with precedence constraints. Comput Optim Appl 17:61–84
3. Baïou M, Mahjoub AR (2002) Steiner 2-edge connected subgraph polytopes on series-parallel graphs. SIAM J Discrete Math 10:505–514
4. Balas E, Fischetti M, Pulleyblank WR (1995) The precedence-constrained asymmetric traveling salesman polytope. Math Program 68:241–265
5. Barnhart C, Hane CA, Vance PH (2000) Using branch-and-price-and-cut to solve origin-destination integer multicommodity Flow problem. Oper Res 48:318–326
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献