Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 2 of 2 for “"Zero-Suppressed Binary Decision Diagram (ZDD)"”.

  1. New methods for branch-and-bound algorithms

    … the pricing problem which respects the branching decisions at the current subproblem). The first method uses a data structure called a zero-suppressed binary decision diagram (ZDD) to solve the pricing problem and keep track of previous branching decisions. Bounds are proved on the size of a ZDD

    uiuc Repository record for New methods for branch-and-bound algorithms (opens in a new tab)

  2. A new algorithm for the quantified satisfiability problem, based on zero-suppressed binary decision diagrams and memoization

    … Boolean formulas. ZQSAT is based on ZBDD: Zero-Suppressed Binary Decision Diagram , which is a variant of BDD, and an adopted version of the DPLL algorithm. It has been implemented in C using the CUDD: Colorado University Decision Diagram package. The capability of ZBDDs in storing sets of …

    potsdam-diss Repository record for A new algorithm for the quantified satisfiability problem, based on zero-suppressed binary decision diagrams and memoization (opens in a new tab)