Discrete Optimization with Decision Diagrams
Discrete Optimization with Decision Diagrams
About this item
Full title
Author / Creator
Publisher
Linthicum: INFORMS
Journal title
Language
English
Formats
Publication information
Publisher
Linthicum: INFORMS
Subjects
More information
Scope and Contents
Contents
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 supply a primal heuristic. Each problem is given a...
Alternative Titles
Full title
Discrete Optimization with Decision Diagrams
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_proquest_journals_2677662730
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_journals_2677662730
Other Identifiers
ISSN
1091-9856
E-ISSN
1526-5528,1091-9856
DOI
10.1287/ijoc.2015.0648
