×

Found 4 Documents (Results 1–4)

Improved approximations for capacitated vehicle routing with unsplittable client demands. (English) Zbl 1497.90172

Aardal, Karen (ed.) et al., Integer programming and combinatorial optimization. 23rd international conference, IPCO 2022, Eindhoven, The Netherlands, June 27–29, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13265, 251-261 (2022).
MSC:  90C27 90C59
PDF BibTeX XML Cite
Full Text: DOI arXiv

A quasi-polynomial time approximation scheme for Euclidean capacitated vehicle routing. (English) Zbl 1288.90073

Charikar, Moses (ed.), Proceedings of the 21st annual ACM-SIAM symposium on discrete algorithms, SODA 2010, Austin, TX, USA, January 17–19, 2010. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM) (ISBN 978-0-89871-698-6/CD-ROM). 390-403 (2010).
MSC:  90C27 68Q25 68W25
PDF BibTeX XML Cite

On a Capacitated Multivehicle Routing Problem. (English) Zbl 1301.90005

Proceedings of the 27th annual ACM symposium on principles of distributed computing, PODC ’08, Toronto, Canada, August 18–21, 2008. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-59593-989-0). 175-184 (2008).
PDF BibTeX XML Cite
Full Text: DOI

Filter Results by …

Document Type

Year of Publication

Main Field