Cole Smith

On Aligning Non-Order-Associated Binary Decision Diagrams.

  • Alexey Bochkarev
  • Cole Smith
    • Categories Combinatorial Optimization, Network Optimization Tags , , ,

    Recent studies employ collections of binary decision diagrams (BDDs) to solve combinatorial optimization problems. This paper focuses on the problem of optimally aligning two BDDs, i.e., transforming them to enforce a common order of variables while keeping the total size of the diagrams as small as possible. We address this problem, which is known to … Read more

    On the Consistent Path Problem

  • David Bergman
  • Leonardo Lozano
  • Cole Smith
    • Categories 0-1 Programming, Combinatorial Optimization, Cutting Plane Approaches

    The application of decision diagrams in combinatorial optimization has proliferated in the last decade. In recent years, authors have begun to investigate how to utilize not one, but a set of diagrams, to model constraints and objective function terms. Optimizing over a collection of decision diagrams, the problem we refer to as the consistent path … Read more