Optimization Bounds from Binary Decision Diagrams

@article{Bergman2014OptimizationBF,
  title={Optimization Bounds from Binary Decision Diagrams},
  author={David Bergman and Andr{\'e} Augusto Cir{\'e} and Willem Jan van Hoeve and John N. Hooker},
  journal={INFORMS Journal on Computing},
  year={2014},
  volume={26},
  pages={253-268}
}
We explore the idea of obtaining bounds on the optimal 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 relaxation of an optimization problem with binary variables, and how to obtain a bound for any separable objective function by solving a shortest (or longest) path problem in the BDD. As a test case we apply the method to the maximum independent set problem on a graph. We find that it can can… CONTINUE READING
Highly Cited
This paper has 34 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 21 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 22 references

Similar Papers

Loading similar papers…