Limited memory rank-1 cuts for vehicle routing problems
type: Item
instance of: scholarly article
title: Limited memory rank-1 cuts for vehicle routing problems
zbMATH Open document ID: 1409.90231
author: Diego Pecin
author: Artur Alves Pessoa
author: Marcus Poggi
author: Eduardo Uchoa
author: Haroldo G. Santos
published in: Operations Research Letters
publication date: 2019-02-22T00:00:00Z
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 7027691
zbMATH Keywords: set partitioning
zbMATH Keywords: polyhedral combinatorics
zbMATH Keywords: branch-cut-and-price algorithms
describes a project that uses: PORTA
MaRDI profile type: Publication
full work available at URL: j.orl.2017.02.006
OpenAlex ID: W2590357187
cites work: Set Partitioning: A survey
cites work: New route relaxation and pricing strategies for the vehicle routing problem
cites work: On the separation of maximally violated mod-\(k\) cuts
cites work: Edmonds polytopes and a hierarchy of combinatorial problems
cites work: A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints
cites work: Optimizing over the first Chvátal closure
cites work: Robust branch-and-cut-and-price for the capacitated vehicle routing problem
cites work: A parallel algorithm for the vehicle routing problem
cites work: Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
cites work: A cooperative parallel metaheuristic for the capacitated vehicle routing problem
cites work: Lagrangian duality applied to the vehicle routing problem with time windows
cites work: 2-path cuts for the vehicle routing problem with time windows
cites work: A problem-reduction evolutionary algorithm for solving the capacitated vehicle routing problem
cites work: Chvátal-Gomory Rank-1 Cuts Used in a Dantzig-Wolfe Decomposition of the Vehicle Routing Problem with Time Windows
cites work: A survey of resource constrained shortest path problems: exact solution approaches
cites work: Clique Inequalities Applied to the Vehicle Routing Problem with Time Windows
cites work: A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
DOI: 10.1016/J.ORL.2017.02.006
description: scientific article; zbMATH DE number 7027691