| New benchmark instances for the capacitated vehicle routing problem E Uchoa, D Pecin, A Pessoa, M Poggi, T Vidal, A Subramanian European Journal of Operational Research 257 (3), 845-858, 2017 | 747 | 2017 |
| Improved branch-cut-and-price for capacitated vehicle routing D Pecin, A Pessoa, M Poggi, E Uchoa Mathematical Programming Computation 9 (1), 61-100, 2017 | 401 | 2017 |
| New enhancements for the exact solution of the vehicle routing problem with time windows D Pecin, C Contardo, G Desaulniers, E Uchoa INFORMS Journal on Computing 29 (3), 489-502, 2017 | 190 | 2017 |
| Efficient elementary and restricted non-elementary route pricing R Martinelli, D Pecin, M Poggi European Journal of Operational Research 239 (1), 102-111, 2014 | 95 | 2014 |
| Limited memory Rank-1 Cuts for Vehicle Routing Problems D Pecin, A Pessoa, M Poggi, E Uchoa, H Santos Operations Research Letters 45 (3), 206-209, 2017 | 68 | 2017 |
| A criterion space method for biobjective mixed integer programming: The boxed line method T Perini, N Boland, D Pecin, M Savelsbergh INFORMS Journal on Computing 32 (1), 16-39, 2020 | 45 | 2020 |
| Comparative analysis of capacitated arc routing formulations for designing a new branch-cut-and-price algorithm D Pecin, E Uchoa Transportation Science 53 (6), 1673-1694, 2019 | 28 | 2019 |
| A branch-cut-and-price algorithm for the capacitated arc routing problem R Martinelli, D Pecin, M Poggi, H Longo International Symposium on Experimental Algorithms, 315-326, 2011 | 25 | 2011 |
| Selective pricing in branch-price-and-cut algorithms for vehicle routing G Desaulniers, D Pecin, C Contardo EURO Journal on Transportation and Logistics, 1-22, 2017 | 20 | 2017 |
| Cvrplib: Capacitated vehicle routing problem library I Lima, E Uchoa, D Pecin, A Pessoa, M Poggi, T Vidal, A Subramanian, ... Date accessed 8 (02), 2022, 2014 | 16 | 2014 |
| Column generation bounds for the capacitated arc routing problem R Martinelli, D Pecin, M Poggi, H Longo Proceedings of the XLII SOBRAPO, 2010 | 11 | 2010 |
| Selective arc‐ng pricing for vehicle routing L Costa, C Contardo, G Desaulniers, D Pecin International Transactions in Operational Research 28 (5), 2633-2690, 2021 | 9 | 2021 |
| A fast and robust algorithm for solving biobjective mixed integer programs D Pecin, I Herszterg, T Perini, N Boland, M Savelsbergh Mathematical Methods of Operations Research 100 (1), 221-262, 2024 | 5 | 2024 |
| Ergonomic Workforce Scheduling: A Multi-Objective Approach W van den Heuvel, S ORTEC, J Augustijn, A van de Wetering, DG Pecin | | 2020 |
| The flower seller problem D den Heijer, TAB Dollevoet, DG Pecin | | 2020 |
| Knowledge-Guided Local Search For The Vehicle Routing Problem DG PECIN, PC BOUMAN | | 2020 |
| The path programming problem and a partial path relaxation T Dollevoet, D Pecin, R Spliet | | 2020 |
| Selective arc-ng pricing for vehicle routing LC Azevedo da Costa, C Contardo, G Desaulniers, DG Pecin Groupe d’études et de recherche en analyse des décisions, 2020 | | 2020 |
| Solving Electric Vehicle Routing Problems using an Adaptive Large Neighbourhood Search M Wagenvoort, DG Pecin, R Spliet | | 2019 |
| Cadernos do LOGIS D Pecin, E Uchoa | | 2017 |
Marcus PoggiPUC-Rio InformaticaVerified email at inf.puc-rio.br
