Results 1 
5 of
5
A Unifying Framework for Integer and Finite Domain Constraint Programming
, 1997
"... We present a unifying framework for integer linear programming and finite domain constraint programming, which is based on a distinction of primitive and nonprimitive constraints and a general notion of branchandinfer. We compare the two approaches with respect to their modeling and solving capab ..."
Abstract

Cited by 35 (2 self)
 Add to MetaCart
We present a unifying framework for integer linear programming and finite domain constraint programming, which is based on a distinction of primitive and nonprimitive constraints and a general notion of branchandinfer. We compare the two approaches with respect to their modeling and solving capabilities. We introduce symbolic constraint abstractions into integer programming. Finally, we discuss possible combinations of the two approaches.
Branch and infer: a unifying framework for integer and finite domain constraint programming
 INFORMS J. COMPUT
, 1998
"... 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 program ..."
Abstract

Cited by 28 (2 self)
 Add to MetaCart
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.
Mixed integer programming models for planning problems
 In Working notes of the CP98 Constraint Problem Reformulation Workshop
, 1998
"... ..."
(Show Context)
Solving 01 problems in CLP(PB
 In Proceedings of the 9th Conference on Artificial Intelligence for Applications. IEEE
"... Many practical problems involve constraints in 01 variables. We apply the constraint logic programming language CLP(PB) to model and reason about 01 problems. Given a set of possibly nonlinear 01 constraints, the solver of CLP(PB) computes an equivalent set of extended clauses. By exploiting t ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
(Show Context)
Many practical problems involve constraints in 01 variables. We apply the constraint logic programming language CLP(PB) to model and reason about 01 problems. Given a set of possibly nonlinear 01 constraints, the solver of CLP(PB) computes an equivalent set of extended clauses. By exploiting the metaprogramming facilities of the logic programming environment, we are able to deal with arbitrary logical conditions between the constraints, in particular with disjunction and implication. At the end, the simplied constraint set is given to an underlying 01 constraint solver, which can be either a constraint programming or a mathematical programming system. 1
PseudoBoolean and Finite Domain Constraint Programming: A Case Study
"... PseudoBoolean constraints are a special form of finite domain constraints where all variables are defined over the domain f0; 1g. To solve pseudoBoolean constraints, specialized constraint solving algorithms have been developed. In this paper, we compare finite domain and pseudoBoolean constraint ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
PseudoBoolean constraints are a special form of finite domain constraints where all variables are defined over the domain f0; 1g. To solve pseudoBoolean constraints, specialized constraint solving algorithms have been developed. In this paper, we compare finite domain and pseudoBoolean constraint techniques on a classical application of finite domain constraint programming, the warehouse location problem. Although the finite domain model is very natural and theoretically has a much smaller search space, the 01 model with specialized constraint solving techniques turns out to be more efficient. 1 Introduction Constraint programming has become a promising new technology for solving complex decision problems. It combines new programming paradigms from computer science, like constraint logic programming and concurrent constraint programming, with efficient constraint solving techniques from mathematics, artificial intelligence, and operations research. Constraint programming allows th...