Journal of Heuristics

, Volume 20, Issue 2, pp 211–234

BDD-based heuristics for binary optimization

  • David Bergman
  • Andre A. Cire
  • Willem-Jan van Hoeve
  • Tallys Yunes
Article

DOI: 10.1007/s10732-014-9238-1

Cite this article as:
Bergman, D., Cire, A.A., van Hoeve, WJ. et al. J Heuristics (2014) 20: 211. doi:10.1007/s10732-014-9238-1

Abstract

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.

Keywords

Binary decision diagramsHeuristicsSet covering Set packing

Copyright information

© Springer Science+Business Media New York 2014

Authors and Affiliations

  • David Bergman
    • 1
  • Andre A. Cire
    • 1
  • Willem-Jan van Hoeve
    • 1
  • Tallys Yunes
    • 2
  1. 1.Tepper School of BusinessCarnegie Mellon UniversityPittsburghUSA
  2. 2.School of Business AdministrationUniversity of MiamiCoral GablesUSA