Learning to Schedule Heuristics in Branch and Bound

Learning to Schedule Heuristics in Branch and Bound

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=jdVfUhqvbRU


Duration: 38:01
913 views
21

Elias Khalil (University of Toronto)
https://simons.berkeley.edu/talks/learning-schedule-heuristics-branch-and-bound
Theoretical Foundations of SAT/SMT Solving



Other Videos By Simons Institute for the Theory of Computing


2021-05-04Towards ML for Quantification in SMT
2021-05-03Data-Driven Synthesis of a Provably Sound Side-Channel Analysis
2021-05-03Synthesizing Network Configuration Updates
2021-04-30Computational Aspects of Equilibria and Fixed Points
2021-04-30Data Privacy | Polylogues
2021-04-29Symmetric Properties and Boolean Complexity
2021-04-29Constraint Satisfaction and Expansion
2021-04-29Theoretically Speaking — Market Design through the Lens of Approximation
2021-04-28Learning to Solve SMT Formulas
2021-04-28Extensions of CDCL Branching Heuristics by Exploration during Conflict Depression
2021-04-28Learning to Schedule Heuristics in Branch and Bound
2021-04-28Predicting Satisfiability at the Phase Transition via End-to-End Learning
2021-04-28Can the PvsNP Question Be Independent of the Axioms of Mathematical Reasoning?
2021-04-28TAUT, TFNP and SAT
2021-04-28P, NP and Proof Complexity
2021-04-28Panel Discussion on Quantum Benchmarking | Quantum Colloquium
2021-04-28Classical Shadows of Quantum States | Quantum Colloquium
2021-04-27Quantified Boolean Formulas
2021-04-27A Finite-Model-Theoretic View on Propositional Proof Complexity
2021-04-27Reasoning Systems from Descriptive Complexity
2021-04-27Past and Present of Descriptive Complexity Theory


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Elias Khalil
Theoretical Foundations of SAT/SMT Solving