Please use this identifier to cite or link to this item:
Title: Limited memory Rank-1 cuts for vehicle routing problems.
Authors: Pecin, Diego Galindo
Pessoa, Artur Alves
Poggi, Marcus
Barboza, Eduardo Uchoa
Santos, Haroldo Gambini
Keywords: Set Partitioning
Polyhedral combinatorics
Branch-cut-and-price algorithms
Issue Date: 2017
Citation: PECIN, 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: <>. Acesso em: 16 jan. 2018.
Abstract: Pecin 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.
ISSN: 01676377
Appears in Collections:DECOM - Artigos publicados em periódicos

Files in This Item:
File Description SizeFormat 
ARTIGO_LimitedMemoryRank.pdf388,47 kBAdobe PDFView/Open    Request a copy

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.