A worst-case analysis for the split delivery vehicle routing problem with minimum delivery amounts
DOI10.1007/S11590-012-0554-9zbMATH Open1280.90016OpenAlexW1977041618MaRDI QIDQ376005FDOQ376005
Authors: Yupei Xiong, Damon Gulczynski, Daniel J. Kleitman, Bruce Golden, Edward Wasil 
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
Recommendations
- Vehicle routing problems with split deliveries
- The split delivery vehicle routing problem: A survey
- An overview on the split delivery vehicle routing problem
- A SPLIT DELIVERY VEHICLE ROUTING PROBLEM
- The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results
Abstract computational complexity for mathematical programming problems (90C60) Transportation, logistics and supply chain management (90B06)
Cites Work
Cited In (9)
- Min-Max vs. Min-Sum vehicle routing: a worst-case analysis
- The bin packing problem with item fragmentation: a worst-case analysis
- Vehicle routing problems with split deliveries
- The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results
- Cargo scheduling decision support for offshore oil and gas production: a case study
- Direct \(k\)-routing versus cross-docking: worst-case results
- A worst-case analysis for the split delivery capacitated team orienteering problem with minimum delivery amounts
- The min-max split delivery multi-depot vehicle routing problem with minimum service time requirement
- A worst-case analysis for the split delivery vehicle routing problem with minimum delivery amounts
This page was built for publication: A worst-case analysis for the split delivery vehicle routing problem with minimum delivery amounts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q376005)
