Euclidean Capacitated Vehicle Routing in Random Setting - A 1.55-Approximation Algorithm
Institut des Hautes Etudes Scientifiques (IHES) via YouTube
Finance Certifications Goldman Sachs & Amazon Teams Trust
Google Data Analytics, IBM AI & Meta Marketing — All in One Subscription
Overview
Google, IBM & Meta Certificates — All 10,000+ Courses at 40% Off
One annual plan covers every course and certificate on Coursera. 40% off for a limited time.
Get Full Access
Explore a groundbreaking 1.55-approximation algorithm for Euclidean Capacitated Vehicle Routing in random settings in this 47-minute lecture presented by Zipei Nie at the Institut des Hautes Etudes Scientifiques (IHES). Delve into the complexities of vehicle routing optimization, focusing on Euclidean spaces and capacitated constraints. Gain insights into the innovative approach that achieves a 1.55 approximation ratio, advancing the field of algorithmic solutions for logistical challenges. Understand the implications of this algorithm for real-world applications in transportation and delivery systems operating under random conditions.
Syllabus
Zipei Nie - Euclidean Capacitated Vehicle Routing in Random Setting: A 1.55-Approximation Algorithm
Taught by
Institut des Hautes Etudes Scientifiques (IHES)