Cost-bounded binary decision diagrams for 0-1 programming

Hadzic, T.;Hooker, J.N.
(2007) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. 4th International Conference, CPAIOR 2007 — Location: Brussels, Belgium (23.May.2007)

Files

No attached file found for this publication.

Details

Authors
  • Hadzic, T.
    Author
  • Hooker, J.N.
    Author
Abstract
In binary decision diagrams (BDDs) were introduced as a technique for postoptimality analysis for integer programming. In this paper we show that much smaller BDDs can be used for the same analysis by employing cost bounding techniques in their construction.
Affiliations

Citations

  • APA
  • Chicago
  • FWB

Hadzic, T., & Hooker, J. N. (2007). Cost-bounded binary decision diagrams for 0-1 programming. In Van Hentenryck, P.; Wolsey, L.; (ed.), Integration of AI and OR Techniques in Constraint Programming forCombinatorial Optimization Problems. Proceedings 4th InternationalConference, CPAIOR 2007 (p. p. 84-98). Springer-verlag. https://hdl.handle.net/2078.5/230952