Manipulating MDD Relaxations for Combinatorial Optimization
We study the application of limited-width MDDs (multi-valued decision diagrams) as discrete relaxations for combinatorial optimization problems. These relaxations are used for the purpose of generating lower bounds. We introduce a new compilation method for constructing such MDDs, as well as algorithms that manipulate the MDDs to obtain stronger relaxations and hence provide stronger lower bounds. We apply our methodology to set covering problems, and evaluate the strength of MDD relaxations to relaxations based on linear programming. Our experimental results indicate that the MDD relaxation is particularly effective on structured problems, being able to outperform state-of-the-art integer programming technology by several orders of magnitude.
KeywordsFeasible Solution Constraint Programming Constraint Matrix Binary Decision Diagram Partial Assignment
Unable to display preview. Download preview PDF.
- 5.Behle, M., Eisenbrand, F.: 0/1 vertex and facet enumeration with BDDs. In: Proceedings of ALENEX. SIAM, Philadelphia (2007)Google Scholar
- 7.Campos, V., Piñana, E., Martí, R.: Adaptive memory programming for matrix bandwidth minimization. Annals of Operations Research (to appear)Google Scholar
- 11.Gurari, E.M., Sudborough, I.H.: Improved dynamic programming algorithms for bandwidth minimization and the mincut linear arrangement problem. ALGORITHMS: Journal of Algorithms 5 (1984)Google Scholar
- 12.Hadzic, T., Hooker, J.N.: Postoptimality analysis for integer programming using binary decision diagrams, presented at GICOLAG workshop (Global Optimization: Integrating Convexity, Optimization, Logic Programming, and Computational Algebraic Geometry), Vienna. Technical report, Carnegie Mellon University (2006)Google Scholar
- 13.Hadzic, T., Hooker, J.N.: Cost-bounded binary decision diagrams for 0-1 programming. Technical report, Carnegie Mellon University (2007)Google Scholar
- 17.Hu, A.J.: Techniques for Efficient Formal Verification Using Binary Decision Diagrams. Technical Report CS-TR-95-1561, Stanford University, Department of Computer Science (1995)Google Scholar