Solving Routing Problems Using Quantum and Hybrid Algorithms
Offered By: HyperComplex Seminar via YouTube
Course Description
Overview
Explore the application of quantum and hybrid algorithms in solving complex routing problems during this 40-minute seminar talk. Delve into the world of NP-hard routing problems, focusing on the Vehicle Routing Problem (VRP) and its variants. Gain insights into formal definitions and popular formulations of these combinatorial optimization problems as QUBO problems. Discover various quantum and hybrid (quantum-classical) solvers capable of tackling these challenges, and examine experimental results comparing their performance to classical solvers. Conclude with a discussion on potential research directions and opportunities for collaboration in this cutting-edge field of study.
Syllabus
Paweł Gora:Solving routing problems using quantum and hybrid algorithms
Taught by
HyperComplex Seminar
Related Courses
Linear and Discrete OptimizationÉcole Polytechnique Fédérale de Lausanne via Coursera Linear and Integer Programming
University of Colorado Boulder via Coursera Approximation Algorithms Part I
École normale supérieure via Coursera Approximation Algorithms Part II
École normale supérieure via Coursera Delivery Problem
University of California, San Diego via Coursera