Optimization Bounds from Binary Decision Diagrams
Work
Year: 2013
Type: article
Abstract: We explore the idea of obtaining bounds on the value of an optimization problem from a discrete relaxation based on binary decision diagrams (BDDs). We show how to construct a BDD that represents a re... more
Source: INFORMS journal on computing
Institution Carnegie Mellon University
Cites: 22
Cited by: 49
Related to: 10
FWCI: 3.709
Citation percentile (by year/subfield): 93.1
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Sustainable Development Goal Peace, justice, and strong institutions
Open Access status: green