Publisher
Springer Nature Switzerland
Reference45 articles.
1. Applegate, D. L., Bixby, R. E., Chvátal, V., & Cook, W. J. (2006). The traveling salesman problem: A computational study. Princeton University Press.
2. Balaprakash, P., Piratari, M., Stützle, T., & Dorigo, M. (2009). Adaptive sample size and importance sampling in estimation-based local search for the probabilistic traveling salesman problem. European Journal of Operational Research, 199(1), 98–110. https://doi.org/10.1016/j.ejor.2008.11.027
3. Balaprakash, P., Piratari, M., Stützle, T., & Dorigo, M. (2010). Estimation-based metaheuristics for the probabilistic traveling salesman problem. Computer & Operations Research, 37(1), 1939–1951. https://doi.org/10.1016/j.cor.2009.12.005
4. Bertsimas, D. (1988). Probabilistic combinatorial optimization problems. PhD Dissertation. Boston: Department of Mathematics, Massachusetts Institute of Technology
5. Bertsimas, D., Jaillet, P., & Odoni, A. R. (1990). A priori optimization. Operations Research, 38(6), 1019–1033. https://doi.org/10.1287/opre.38.6.1019