Limited memory Rank-1 cuts for vehicle routing problems.

Registro completo de metadados
MetadadosDescriçãoIdioma
Autor(es): dc.creatorPecin, Diego Galindo-
Autor(es): dc.creatorPessoa, Artur Alves-
Autor(es): dc.creatorPoggi, Marcus-
Autor(es): dc.creatorBarboza, Eduardo Uchoa-
Autor(es): dc.creatorSantos, Haroldo Gambini-
Data de aceite: dc.date.accessioned2025-08-21T15:58:52Z-
Data de disponibilização: dc.date.available2025-08-21T15:58:52Z-
Data de envio: dc.date.issued2018-01-26-
Data de envio: dc.date.issued2018-01-26-
Data de envio: dc.date.issued2017-
Fonte completa do material: dc.identifierhttp://www.repositorio.ufop.br/handle/123456789/9360-
Fonte completa do material: dc.identifierhttps://www.sciencedirect.com/science/article/pii/S0167637717301049-
Fonte completa do material: dc.identifierhttps://doi.org/10.1016/j.orl.2017.02.006-
Fonte: dc.identifier.urihttp://educapes.capes.gov.br/handle/capes/1029160-
Descrição: dc.descriptionPecin 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.-
Formato: dc.formatapplication/pdf-
Idioma: dc.languageen-
Direitos: dc.rightsrestrito-
Palavras-chave: dc.subjectSet Partitioning-
Palavras-chave: dc.subjectPolyhedral combinatorics-
Palavras-chave: dc.subjectBranch-cut-and-price algorithms-
Título: dc.titleLimited memory Rank-1 cuts for vehicle routing problems.-
Aparece nas coleções:Repositório Institucional - UFOP

Não existem arquivos associados a este item.