BIRS Workshop Lecture Videos

Banff International Research Station Logo

BIRS Workshop Lecture Videos

Combinatorial Problem Solving with Serial and Nonserial Decision Diagrams Hooker, John

Description

Decision diagrams (DDs) are an old concept in computer science but in recent years have been repurposed as a novel approach to combinatorial optimization and constraint solving. Part 1 of this talk is a brief survey of developments in this area. It covers DD basics, relaxed and restricted DDs, DD-based branch and bound, DD-based Lagrangian relaxation, and DD-based constraint propagation in constraint programming. Part 2 describes recent research that generalizes the serial DDs of previous work to nonserial DDs. These can achieve dramatic speedups on problems with small treewidth; that is, problems in which the variables are loosely coupled. Computational results are presented.

Item Media

Item Citations and Data

Rights

Attribution-NonCommercial-NoDerivatives 4.0 International