Greger Ottosson, Erlendur S. Thorsteinsson, John N. Hooker
Abstract The complementing strengths of Constraint (Logic) Programming (CLP) and Mixed Integer Programming (IP) have recently received signicant attention. Although various optimization and...
the traditional Benders Decomposition and Branch-and-Bound as special cases. In particular we describe its relation to Benders and the use of nogoods and linear relaxations. We give two examples of...
Global constraints: When constraint programming meets operation research (2001)
Michela Milano, Greger Ottosson, Erlendur S. Thorsteinsson, Antipolis France
Eorts aimed at combining Operations Research and Constraint Programming have become increasingly prominent and successful in the last few years. It is now widely recognised that integrating inference...
Michela Milano Greger, Michela Milano, Greger Ottosson, Erlendur S. Thorsteinsson
Efforts aimed at combining Operations Research and Constraint Programming have become increasingly prominent and successful in the last few years. It is now widely recognized that integrating...
A Scheme for Unifying Optimization and Constraint Satisfaction Methods (2000)
John N. Hooker, Greger Ottosson, Erlendur S. Thorsteinsson, Hak-jin Kim
Optimization and constraint satisfaction methods are complementary to a large extent, and there has been much recent interest in combining them. Yet no generally accepted principle or scheme for...
A Scheme for Unifying Optimization and Constraint Satisfaction Methods (2000)
John Hooker Greger, John Hooker, Greger Ottosson, Erlendur S. Thorsteinsson, Hak-jin Kim
Optimization and constraint satisfaction methods are complementary to a large extent, and there has been much recent interest in combining them. Yet no generally accepted principle or scheme for...
Bjarni V. Halldórsson, Erlendur S. Thorsteinsson, Bjarni Kristjánsson
We present a Modeler-Optimizer Interface (MOI) for general closed form Non-Linear Programs (NLP), which can be used to to transfer NLPs in a clear and simple manner between optimization components in...
Linear Relaxations and Reduced-Cost Based Propagation of Continuous Variable Subscripts (2000)
Greger Ottosson, Erlendur S. Thorsteinsson
In hybrid solvers for combinatorial optimization, combining Constraint (Logic) Programming (CLP) and Mixed Integer Programming (MIP), it is important to have tight connections between the two...
Mixed Global Constraints and Inference in Hybrid CLPIP Solvers (1999)
Greger Ottosson Erlendur, Greger Ottosson, Erlendur S. Thorsteinsson, John N. Hooker
The complementing strengths of Constraint (Logic) Programming (CLP) and Mixed Integer Programming (IP) have recently received signicant attention. Although various optimization and constraint...
On Integrating Constraint Propagation and Linear Programming for Combinatorial Optimization (1999)
John Hooker Greger, John N. Hooker, Greger Ottosson, Erlendur S. Thorsteinsson, Hak-jin Kim
Linear programming and constraint propagation are complementary techniques with the potential for integration to benefit the solution of combinatorial optimization problems. Attempts to combine them...
xMPS, the Extended MPS Format for Non-Linear Programs (1999)
We present a le format for Non-Linear Programs (NLP), the extended MPS format (xMPS). This format directly extends the standard MPS le format for Linear and Mixed Integer Programs to include NLPs and...
Mixed Global Constraints and Inference in Hybrid CLPIP Solvers (1999)
Greger Ottosson Erlendur, Greger Ottosson, Erlendur S. Thorsteinsson, John N. Hooker
The complementing strengths of Constraint (Logic) Programming (CLP) and Mixed Integer Programming (IP) have recently received signicant attention. Although various optimization and constraint...
On Integrating Constraint Propagation and Linear Programming for Combinatorial Optimization (1999)
John N. Hooker, Greger Ottosson, Erlendur S. Thorsteinsson, Hak-Jin Kim, Hak-jin Kimy
Linear programming and constraint propagation are complementary techniques with the potential for integration to benefit the solution of combinatorial optimization problems. Attempts to combine them...