BDD-based heuristics for binary optimization

David Bergman, Andre A. Cire, Willem Jan Van Hoeve, Tallys Yunes

Research output: Contribution to journalArticlepeer-review

21 Scopus citations


In this paper we introduce a new method for generating heuristic solutions to binary optimization problems. We develop a technique based on binary decision diagrams. We use these structures to provide an under-approximation to the set of feasible solutions. We show that the proposed algorithm delivers comparable solutions to a state-of-the-art general-purpose optimization solver on randomly generated set covering and set packing problems.

Original languageEnglish (US)
Pages (from-to)211-234
Number of pages24
JournalJournal of Heuristics
Issue number2
StatePublished - Apr 2014


  • Binary decision diagrams
  • Heuristics
  • Set covering
  • Set packing

ASJC Scopus subject areas

  • Software
  • Information Systems
  • Computer Networks and Communications
  • Control and Optimization
  • Management Science and Operations Research
  • Artificial Intelligence


Dive into the research topics of 'BDD-based heuristics for binary optimization'. Together they form a unique fingerprint.

Cite this