Article

Journal of Heuristics

, Volume 20, Issue 2, pp 211-234

BDD-based heuristics for binary optimization

  • David BergmanAffiliated withTepper School of Business, Carnegie Mellon University
  • , Andre A. CireAffiliated withTepper School of Business, Carnegie Mellon University
  • , Willem-Jan van HoeveAffiliated withTepper School of Business, Carnegie Mellon University
  • , Tallys YunesAffiliated withSchool of Business Administration, University of Miami Email author 

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

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 diagrams Heuristics Set covering Set packing