A Branch-Cut-and-Price Algorithm for the Capacitated Arc Routing Problem. - Rafael Martinelli; Diego Pecin; Marcus Poggi; Humberto J. Longo (SEA, 2011)

Efficient elementary and restricted non-elementary route pricing. - Rafael Martinelli; Diego Pecin; Marcus Poggi (Eur. J. Oper. Res., 2014)

New benchmark instances for the Capacitated Vehicle Routing Problem. - Eduardo Uchoa; Diego Pecin; Artur Alves Pessoa; Marcus Poggi; Thibaut Vidal; Anand Subramanian 001 (Eur. J. Oper. Res., 2017)

New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows. - Diego Pecin; Claudio Contardo; Guy Desaulniers; Eduardo Uchoa (INFORMS J. Comput., 2017)

Improved branch-cut-and-price for capacitated vehicle routing. - Diego Pecin; Artur Alves Pessoa; Marcus Poggi; Eduardo Uchoa (Math. Program. Comput., 2017)

Limited memory Rank-1 Cuts for Vehicle Routing Problems. - Diego Pecin; Artur Alves Pessoa; Marcus Poggi; Eduardo Uchoa; Haroldo G. Santos (Oper. Res. Lett., 2017)

Selective pricing in branch-price-and-cut algorithms for vehicle routing. - Guy Desaulniers; Diego Pecin; Claudio Contardo (EURO J. Transp. Logist., 2019)

Comparative Analysis of Capacitated Arc Routing Formulations for Designing a New Branch-Cut-and-Price Algorithm. - Diego Pecin; Eduardo Uchoa (Transp. Sci., 2019)

A Criterion Space Method for Biobjective Mixed Integer Programming: The Boxed Line Method. - Tyler A. Perini; Natashia Boland; Diego Pecin; Martin W. P. Savelsbergh (INFORMS J. Comput., 2020)

Selective arc-ng pricing for vehicle routing. - Luciano Costa; Claudio Contardo; Guy Desaulniers; Diego Pecin (Int. Trans. Oper. Res., 2021)

A fast and robust algorithm for solving biobjective mixed integer programs. - Diego Pecin; Ian Herszterg; Tyler A. Perini; Natashia Boland; Martin W. P. Savelsbergh (Math. Methods Oper. Res., 2024)