1. David Applegate, Wiliam Cook, and Andre Rohe. 2003. Chained Lin-Kernighan for large traveling salesman problems. INFORMS Journal on Computing; Winter 15 (2003), 82--92. Issue 1.
2. Hirad Assimi, Oscar Harper, Yue Xie, Aneta Neumann, and Frank Neumann. 2020. Evolutionary Bi-objective Optimization for the Dynamic Chance-Constrained Knapsack Problem Based on Tail Bound Objectives. In ECAI 2020 - Proceedings of the European Conference on Artificial Intelligence. IOS Press, 307--314.
3. Waiting and Relocation Strategies in Online Stochastic Vehicle Routing. Waiting and Relocation Strategies in Online Stochastic Vehicle Routing;Bent Russell;IJCAI,2007
4. Russell Bent and Pascal Van Hentenryck. 2003. Dynamic vehicle routing with stochastic requests. In IJCAI 2003 - Proceedings of the 18th International Joint Conference on Artificial Intelligence. 1362--1363.
5. The travelling thief problem: The first step in the transition from theoretical problems to realistic problems