Machine Learning and Monte Carlo Sampling for the Probabilistic Orienteering Problem. - Roberto Montemanni; Federico D'ignazio; Xiaochen Chou; Luca Maria Gambardella (SCIS&ISIS, 2018)

A Metaheuristic Algorithm for the Probabilistic Orienteering Problem. - Xiaochen Chou; Luca Maria Gambardella; Roberto Montemanni (MLMI, 2019)

Optimization Strategies for In-Store Order Picking in Omnichannel Retailing. - Xiaochen Chou; Nicola Ognibene Pietri; Dominic Loske; Matthias Klumpp; Roberto Montemanni (APMS (2), 2021)

The Picking and Packing Problem in Buy-Online-Pick-up-in-Store Retailing. - Nicola Ognibene Pietri; Xiaochen Chou; Dominic Loske; Matthias Klumpp; Jafar Jamal; Roberto Montemanni (OR, 2021)

The Buy-Online-Pick-Up-in-Store Retailing Model: Optimization Strategies for In-Store Picking and Packing. - Nicola Ognibene Pietri; Xiaochen Chou; Dominic Loske; Matthias Klumpp; Roberto Montemanni (Algorithms, 2021)

A Tabu Search algorithm for the Probabilistic Orienteering Problem. - Xiaochen Chou; Luca Maria Gambardella; Roberto Montemanni (Comput. Oper. Res., 2021)

AMR-Assisted Order Picking: Models for Picker-to-Parts Systems in a Two-Blocks Warehouse. - Giulia Pugliese; Xiaochen Chou; Dominic Loske; Matthias Klumpp; Roberto Montemanni (Algorithms, 2022)

Upper and lower bounds based on linear programming for the b-coloring problem. - Roberto Montemanni; Xiaochen Chou; Derek H. Smith (EURO J. Comput. Optim., 2022)

Problem-Driven Scenario Generation for Stochastic Programming Problems: A Survey. - Xiaochen Chou; Enza Messina (Algorithms, 2023)

Precedence-Constrained arborescences. - Xiaochen Chou; Mauro Dell'Amico; Jafar Jamal; Roberto Montemanni (Eur. J. Oper. Res., 2023)

Solving Two-Stage Stochastic Programming Problems via Machine Learning. - Xiaochen Chou; Enza Messina; Stein W. Wallace (LOD (1), 2024)