Diego Pecin

According to our database, Diego Pecin authored at least 10 papers between 2011 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2021

Selective arc-ng pricing for vehicle routing.

Luciano Costa, Claudio Contardo, Guy Desaulniers, Diego Pecin

Int. Trans. Oper. Res., 2021

2020

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

2019

Comparative Analysis of Capacitated Arc Routing Formulations for Designing a New Branch-Cut-and-Price Algorithm.

Diego Pecin, Eduardo Uchoa

Transp. Sci., 2019

Selective pricing in branch-price-and-cut algorithms for vehicle routing.

Guy Desaulniers, Diego Pecin, Claudio Contardo

EURO J. Transp. Logist., 2019

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

Improved branch-cut-and-price for capacitated vehicle routing.

Diego Pecin, Artur Alves Pessoa, Marcus Poggi, Eduardo Uchoa

Math. Program. Comput., 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

New benchmark instances for the Capacitated Vehicle Routing Problem.

Eduardo Uchoa, Diego Pecin, Artur Alves Pessoa, Marcus Poggi, Thibaut Vidal, Anand Subramanian

Eur. J. Oper. Res., 2017

2014

Efficient elementary and restricted non-elementary route pricing.

Rafael Martinelli, Diego Pecin, Marcus Poggi

Eur. J. Oper. Res., 2014

2011

A Branch-Cut-and-Price Algorithm for the Capacitated Arc Routing Problem.

Rafael Martinelli, Diego Pecin, Marcus Poggi, Humberto J. Longo

Proceedings of the Experimental Algorithms - 10th International Symposium, 2011