Pecin, Diego GalindoPessoa, Artur AlvesPoggi, MarcusBarboza, Eduardo UchoaSantos, Haroldo Gambini2018-01-262018-01-262017PECIN, D. G. et al. Limited memory Rank-1 cuts for vehicle routing problems. Operations Research Letters, v. 45,p. 206-209, 2017. Disponível em: <https://www.sciencedirect.com/science/article/pii/S0167637717301049>. Acesso em: 16 jan. 2018.0167-6377http://www.repositorio.ufop.br/handle/123456789/9360Pecin et al. (2016) introduced a ‘‘limited memory’’ technique that allows an efficient use of Rank-1 cuts in the Set Partitioning Formulation of Vehicle Routing Problems, motivating a deeper investigation of those cuts. This work presents a computational polyhedral study that determines the best possible sets of multipliers for cuts with up to 5 rows. Experiments with CVRP instances show that the new multipliers lead to significantly improved dual bounds and contributes decisively for solving an open instance with 420 customers.en-USrestritoSet PartitioningPolyhedral combinatoricsBranch-cut-and-price algorithmsArtigo publicado em periodicohttps://www.sciencedirect.com/science/article/pii/S0167637717301049https://doi.org/10.1016/j.orl.2017.02.006