Bilbiography for SPOC20

Bilbiography for the "Autumn school on Advanced BCP Tools:
VRPSolver and Coluna"

[Back to the main page]

Main Bibliography:

Pessoa, A., Sadykov, R., Uchoa, E., & Vanderbeck, F. (2019). A Generic Exact Solver for Vehicle Routing and Related Problems. In International Conference on Integer Programming and Combinatorial Optimization, LNCS Vol. 11480, 354-369, Springer. Full version:

Complementary Bibliography:

Paradiso, R., Roberti, R., Laganà, D. & Dullaert, W. (2019) An Exact Solution Framework for Multi-Trip Vehicle Routing Problems with Time Windows, Operations Research (forthcoming).

Costa, L., Contardo, C., & Desaulniers, G. (2019). Exact Branch-Price-and-Cut Algorithms for Vehicle Routing. Transportation Science, 53(4), 946-985.

Liguori, P., Mahjoub, A.R., Sadykov, R. & Uchoa, E. (2019) A Branch-and-Cut-and-Price Algorithm for the Capacitated Location-Routing Problem, Proceedings of the 10th TRISTAN.

Marques, G., Sadykov, R., Deschamps, J. C., & Dupas, R. (2019). An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem. Report hal-02112287.

Bulhões, T., Pessoa, A., Protti, F., & Uchoa, E. (2018). On the complete set packing and set partitioning polytopes: Properties and rank 1 facets. Operations Research Letters, 46(4), 389-392.

Sadykov, R., Uchoa, E., & Artur Pessoa. "A bucket graph based labeling algorithm with application to vehicle routing." Cadernos do LOGIS, 7 (2017).

Pecin, D., Contardo, C., Desaulniers, G., & Uchoa, E. (2017). New enhancements for the exact solution of the vehicle routing problem with time windows. INFORMS Journal on Computing, 29(3), 489-502.

Pecin, D., Pessoa, A., Poggi, M., & Uchoa, E. (2017). Improved branch-cut-and-price for capacitated vehicle routing. Mathematical Programming Computation, 9(1), 61-100.

Poggi, M., & Uchoa, E. (2014). Chapter 3: New exact algorithms for the capacitated vehicle routing problem. In Vehicle Routing: Problems, Methods, and Applications, Second Edition (pp. 59-86). Society for Industrial and Applied Mathematics.

Contardo, C., & Martinelli, R. (2014). A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints. Discrete Optimization, 12, 129-146.

Baldacci, R., Mingozzi, A., & Roberti, R. (2011). New route relaxation and pricing strategies for the vehicle routing problem. Operations research, 59(5), 1269-1283.

Vanderbeck, F., & Wolsey, L. A. (2010). Reformulation and decomposition of integer programs. In 50 Years of Integer Programming 1958-2008 (pp. 431-502). Springer, Berlin, Heidelberg.

Fukasawa, R., Longo, H., Lysgaard, J., de Aragão, M. P., Reis, M., Uchoa, E., & Werneck, R. F. (2006). Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Mathematical programming, 106(3), 491-511.

Irnich, S., & Desaulniers, G. (2005). Shortest path problems with resource constraints. In Column generation (pp. 33-65). Springer, Boston, MA