T. Perini, N. Boland, D. Pecin & M. Savelsbergh (2019). The boxed line method for biobjective mixed integer linear programming. INFORMS Journal on Computing.
D. Pecin & E. Eduardo (2019). Comparative analysis of capacitated arc routing formulations and branch-cut-and-price algorithm. Transportation Science.
D. Pecin, C. Contardo, G. Desaulniers & E. Uchoa (2017). New enhancements for the exact solution of the vehicle routing problem with time windows. INFORMS Journal on Computing, 29 (3), 489-502. doi: 10.1287/ijoc.2016.0744
D. Pecin, A. Pessoa, M. Poggi, E. Uchoa & H. Santos (2017). Limited memory rank-1 cuts for vehicle routing problems. Operations Research Letters, 45, 206-209. doi: 10.1007/s13676-017-0112-9
G. Desaulniers, D. Pecin & C. Contardo (2017). Selective pricing in branch-price-and-cut algorithms for vehicle routing. EURO Journal on transportation and logistics. doi: 10.1007/s13676-017-0112-9
D. Pecin, A. Pessoa, M. Poggi & E. Uchoa (2017). Improved branch-cut-and-price for capacitated vehicle routing. Mathematical Programming Computation, 9, 61-100. doi: 10.1007/s12532-016-0108-8
E. Uchoa, D. Pecin, A. Pessoa, M. Poggi & T. Vidal (2016). New benchmark instances for the capacitated vehicle routing problem. European Journal of Operational Research, 257, 845-858. doi: 10.1016/j.ejor.2016.08.012
R. Martinelli, D. Pecin & M. Poggi (2014). Efficient elementary and restricted non-elementary route pricing. European Journal of Operational Research, 239, 102-111. doi: 10.1016/j.ejor.2014.05.005