Computer Software
Print ISSN : 0289-6540
ZDDs and Enumeration Problems: State-of-The-Art Techniques and Programming Tool
Takahisa TODAToshiki SAITOHHiroaki IWASHITAJun KAWAHARAShin-ichi MINATO
Author information
JOURNAL FREE ACCESS

2017 Volume 34 Issue 3 Pages 3_97-3_120

Details
Abstract

Combinatorial enumeration problems are to find all combinations of items (solutions) that satisfy given constraints. There are many applications to various problems that are closely related to real-life such as power distribution network analysis. Recent researches have paid attention to a generic framework for computing various combinatorial enumeration problems through the method of efficiently constructing the data structure, ZDD, for all solutions of those problems in a top-down fashion, which is thus called top-down ZDD construction. The paper focuses on this subject and provides a comprehensive survey on algorithms that the construction is based on, an extended method for efficiently handling complicated constraints, the basics of the programming tool, TdZdd, that allows us to easily develop top-down construction-based programs, and practical programming examples of some applied problems.

Content from these authors
© 2017 Japan Society for Software Science and Technology
Previous article Next article
feedback
Top