Asynchronous Lagrangian scenario decomposition Ignacio AravenaAnthony Papavasiliou Full Length Paper Open access 14 March 2020 Pages: 1 - 50
Hard to solve instances of the Euclidean Traveling Salesman Problem Stefan HougardyXianghui Zhong Full Length Paper Open access 12 March 2020 Pages: 51 - 74
Mixed-integer programming techniques for the connected max-k-cut problem Christopher HojnyImke JoormannMartin Schmidt Full Length Paper Open access 30 April 2020 Pages: 75 - 132
MiniCP: a lightweight solver for constraint programming L. MichelP. SchausP. Van Hentenryck Full Length Paper 05 February 2021 Pages: 133 - 184
A column and constraint generation algorithm for the dynamic knapsack problem with stochastic item sizes Daniel BladoAlejandro Toriello Full Length Paper 26 June 2020 Pages: 185 - 223