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

1 August 1998

journal article
Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing

Vol. 10 (3) , 287-300
https://doi.org/10.1287/ijoc.10.3.287

Abstract

We introduce branch and infer, a unifying framework for integer linear programming and finite domain constraint programming. We use this framework to compare the two approaches with respect to their modeling and solving capabilities, to introduce symbolic constraint abstractions into integer programming, and to discuss possible combinations of the two approaches.

Keywords

This publication has 28 references indexed in Scilit:

Strategic directions in constraint programming
ACM Computing Surveys, 1996
Practical applications of constraint programming
Constraints, 1996
Solving Multiple Knapsack Problems by Cutting Planes
SIAM Journal on Optimization, 1996
Gomory cuts revisited
Operations Research Letters, 1996
The Oz Programming Model
Published by Springer Nature ,1995
Introducing global constraints in CHIP
Mathematical and Computer Modelling, 1994
Constraint logic programming: a survey
The Journal of Logic Programming, 1994
Extending chip in order to solve complex scheduling and placement problems
Mathematical and Computer Modelling, 1993
A canonical form for generalized linear constraints
Journal of Symbolic Computation, 1992
An Introduction to First-Order Logic
Published by Elsevier ,1977