BDD-based heuristics for binary optimization

Authors:
David Bergman;Andre A. Cire;Willem-Jan Hoeve;Tallys Yunes
Affiliations:
Tepper School of Business, Carnegie Mellon University, Pittsburgh, USA 15213;Tepper School of Business, Carnegie Mellon University, Pittsburgh, USA 15213;Tepper School of Business, Carnegie Mellon University, Pittsburgh, USA 15213;School of Business Administration, University of Miami, Coral Gables, USA 33124-8237
Venue:
Journal of Heuristics
Year:
2014

Citing 19
Cited 0

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
Finding exact solutions to the bandwidth minimization problem

Computing
Approximating the bandwidth via volume respecting embeddings

Journal of Computer and System Sciences - 30th annual ACM symposium on theory of computing
Local Search in Combinatorial Optimization

Local Search in Combinatorial Optimization
General Purpose Heuristics for Integer Programming—Part II

Journal of Heuristics
Techniques for Efficient Formal Verification Using Binary Decision Diagrams

Techniques for Efficient Formal Verification Using Binary Decision Diagrams
The feasibility pump

Mathematical Programming: Series A and B
Pivot, Cut, and Dive: a heuristic for 0-1 mixed integer programming

Journal of Heuristics
Binary Decision Diagrams

IEEE Transactions on Computers
Cost-Bounded Binary Decision Diagrams for 0-1 Programming

CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Approximate Compilation of Constraints into Multivalued Decision Diagrams

CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Simple ingredients leading to very efficient heuristics for the maximum clique problem

Journal of Heuristics
A constraint store based on multivalued decision diagrams

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
A systematic approach to MDD-based constraint programming

CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Cooperating local search for the maximum clique problem

Journal of Heuristics
Manipulating MDD relaxations for combinatorial optimization

CPAIOR'11 Proceedings of the 8th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
BDDs in a branch and cut framework

WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Variable ordering for the application of BDDs to the maximum independent set problem

CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
A New Local Search Algorithm for Binary Optimization

INFORMS Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

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.