Branch-and-Infer: A Unifying Framework for Integer Linear Programming and Finite Domain Constraint Programming

Alexander Bockmayr (1) , Thomas Kasper

1 PROTHEO - Constraints, automatic deduction and software properties proofs

Integer linear programming and finite domain constraint programming are two general approaches for solving discrete optimization problems. We present a unifying framework, branch-and-infer, to clarify the relationship between these two approaches and to show how they can be integrated.

Mots clés: constraint programming; programmation entière; integer programming; programmation par contraintes

Domaines: Autre [cs.OH]

Alexander Bockmayr, Thomas Kasper. Branch-and-Infer: A Unifying Framework for Integer Linear Programming and Finite Domain Constraint Programming. Journées Francophones de Programmation Logique et Programmation par Contraintes - JFPLC'99, 1999, Lyon, France, pp.141-142. ⟨inria-00099013⟩