User menu

Accès à distance ? S'identifier sur le proxy UCLouvain

Cost-bounded binary decision diagrams for 0-1 programming

Primary tabs

Hadzic, T. Hooker, J.N.

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.

Document type Communication à un colloque (Conference Paper) – Présentation orale avec comité de sélection
Publication date 2007
Conference "Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. 4th International Conference, CPAIOR 2007", Brussels, Belgium (23-26 May 2007)
Peer reviewed yes
Host document Van Hentenryck, P.; Wolsey, L.; ; "Integration of AI and OR Techniques in Constraint Programming forCombinatorial Optimization Problems. Proceedings 4th InternationalConference, CPAIOR 2007"- p. 84-98 (ISBN : 3-540-72396-X)
Publisher Springer-verlag
Affiliation UCL
Links
Bibliographic reference Hadzic, T. ; Hooker, J.N.. Cost-bounded binary decision diagrams for 0-1 programming.Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. 4th International Conference, CPAIOR 2007 (Brussels, Belgium, 23-26 May 2007). In: Van Hentenryck, P.; Wolsey, L.;, Integration of AI and OR Techniques in Constraint Programming forCombinatorial Optimization Problems. Proceedings 4th InternationalConference, CPAIOR 2007, Springer-verlag2007, p. 84-98
Permanent URL http://hdl.handle.net/2078.1/67859