Journal
OPERATIONS RESEARCH LETTERS
Volume 45, Issue 3, Pages 206-209Publisher
ELSEVIER
DOI: 10.1016/j.orl.2017.02.006
Keywords
Set Partitioning; Polyhedral combinatorics; Branch-cut-and-price algorithms
Categories
Funding
- Conselho Nacional de Desenvolvimento Cientifico e Tecnologico (CNPq) [301278/2013-0, 309012/2014-7, 310855/2013-6, 311608/2016-7]
- Fundacao de Amparo a Pesquisa de Minas Gerais (FAPEMIG) [APQ-01944-16]
Ask authors/readers for more resources
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. (C) 2017 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
