Cost-Bounded Binary Decision Diagrams for 0-1 Programming.pdf.pdf' (217.24 kB)
Cost-Bounded Binary Decision Diagrams for 0-1 Programming
journal contributionposted on 1997-01-01, 00:00 authored by Tarik Hadzic, John N. Hooker
In recent work 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.