Learning to Bound Using Decision Diagrams and Reinforcement Learning
Offered By: GERAD Research Center via YouTube
Course Description
Overview
Explore a cutting-edge approach to finding tight bounds for discrete optimization problems in this DS4DM Coffee Talk. Delve into the world of decision diagrams and their role in obtaining superior upper and lower bounds compared to traditional methods like linear relaxations. Discover how the variable ordering significantly impacts the quality of bounds achieved through decision diagrams, and learn about the challenges in optimizing this ordering. Gain insights into a novel generic approach that leverages deep reinforcement learning to determine an optimal ordering for tightening bounds obtained with approximate decision diagrams. Understand how these improved bounds can be effectively utilized to enhance the performance of branch-and-bound algorithms, potentially revolutionizing solution methods for complex optimization problems.
Syllabus
Learning to Bound Using Decision Diagrams and Reinforcement Learning, Quentin Cappart
Taught by
GERAD Research Center
Related Courses
Discrete OptimizationUniversity of Melbourne via Coursera Linear and Discrete Optimization
École Polytechnique Fédérale de Lausanne via Coursera Modeling Discrete Optimization
University of Melbourne via Coursera Advanced Modeling for Discrete Optimization
University of Melbourne via Coursera Advanced Modeling for Discrete Optimization 离散优化建模高阶篇
The Chinese University of Hong Kong via Coursera