Improved lower bounds for the split delivery vehicle routing problem
type: Item
instance of: scholarly article
title: Improved lower bounds for the split delivery vehicle routing problem
zbMATH Open document ID: 1193.90068
author: Lorenza Moreno
author: Marcus Poggi de Aragão
author: Eduardo Uchoa
published in: Operations Research Letters
publication date: 2010-09-07T00:00:00Z
Mathematics Subject Classification ID: 90B20
zbMATH DE Number: 5780107
zbMATH Keywords: split delivery
zbMATH Keywords: extended formulation
zbMATH Keywords: column generation
zbMATH Keywords: cutting-plane algorithm
describes a project that uses: VRP
MaRDI profile type: Publication
full work available at URL: j.orl.2010.04.008
OpenAlex ID: W2065962145
cites work: A Lower Bound for the Split Delivery Vehicle Routing Problem
cites work: The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results
cites work: Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
cites work: Vehicle routing with split deliveries
cites work: Savings by Split Delivery Routing
cites work: Robust branch-and-cut-and-price for the capacitated vehicle routing problem
cites work: A column generation approach for the split delivery vehicle routing problem
cites work: A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem
cites work: Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation
DOI: 10.1016/J.ORL.2010.04.008
description: scientific article; zbMATH DE number 5780107