A worst-case analysis for the split delivery vehicle routing problem with minimum delivery amounts
From MaRDI portal
Publication:376005
DOI10.1007/s11590-012-0554-9zbMath1280.90016OpenAlexW1977041618MaRDI QIDQ376005
Damon Gulczynski, Yupei Xiong, Daniel J. Kleitman, Edward A. Wasil, Bruce L. Golden
Publication date: 1 November 2013
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-012-0554-9
Abstract computational complexity for mathematical programming problems (90C60) Transportation, logistics and supply chain management (90B06)
Related Items (6)
Cargo scheduling decision support for offshore oil and gas production: a case study ⋮ A worst-case analysis for the split delivery vehicle routing problem with minimum delivery amounts ⋮ The bin packing problem with item fragmentation: a worst-case analysis ⋮ A worst-case analysis for the split delivery capacitated team orienteering problem with minimum delivery amounts ⋮ Vehicle routing problems with split deliveries ⋮ Direct \(k\)-routing versus cross-docking: worst-case results
Cites Work
This page was built for publication: A worst-case analysis for the split delivery vehicle routing problem with minimum delivery amounts
