Discrete Optimization with Decision Diagrams

We propose a general branch-and-bound algorithm for discrete optimization in which binary decision diagrams (BDDs) play the role of the traditional linear programming relaxation. In particular, relaxed BDD representations of the problem provide bounds and guidance for branching, and restricted BDDs...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	INFORMS journal on computing 2016-12, Vol.28 (1), p.47-66
Hauptverfasser:	Bergman, David, Cire, Andre A., van Hoeve, Willem-Jan, Hooker, J. N.
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms branch and bound deterministic Dynamic programming Heuristic integer Integer programming Linear programming networks/graphs Optimization programming Solvers
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!