Author:
Birattari Mauro,Balaprakash Prasanna,Stützle Thomas,Dorigo Marco
Publisher
Institute for Operations Research and the Management Sciences (INFORMS)
Reference24 articles.
1. Fast Algorithms for Geometric Traveling Salesman Problems
2. Bertsimas D. Probabilistic combinatorial optimization problems. (1988) . Ph.D. thesis, Massachusetts Institute of Technology, Cambridge
3. A Priori Optimization
4. Bianchi L. Ant colony optimization and local search for the probabilistic traveling salesman problem: A case study in stochastic combinatorial optimization. (2006) . Ph.D. thesis, Université Libre de Bruxelles, Brussels, Belgium
5. Extension of the 2-p-opt and 1-shift algorithms to the heterogeneous probabilistic traveling salesman problem
Cited by
33 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献