//-->
The interval min-max regret knapsack packing-delivery problem
Wang, Shijin, (2021)
New formulation and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks
Sampaio, Afonso H., (2017)
The capacitated family traveling salesperson problem
Domínguez-Casasola, Saúl, (2024)
A survey of different integer programming formulations of the travelling salesman problem
Orman, A. J., (2004)
The dependency diagram of a mixed integer linear programme
Williams, Hilary P., (2017)
The problem with integer programming
Williams, Hilary P., (2011)