A Comparison of CP, IP and Hybrids for Configuration Problems (2007)
Mats Carlsson Matsc, Greger Ottosson
We investigate different solution techniques for solving a basic part of configuration problems, namely linear arithmetic constraints over integer variables. Approaches include integer programming,...
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...
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...
Integration of Constraint Programming and Integer Programming for Combinatorial Optimization (2000)
Greger Ottosson, Greger Ottosson
The last several years have seen an increasing interest in combining the models and methods of optimization with those of constraint programming. Integration of the two was initially impeded by their...
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...
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...
Integration of Constraint Programming and Integer Programming for Combinatorial Optimization (2000)
Greger Ottosson, Greger Ottosson
The last several years have seen an increasing interest in combining the models and methods of optimization with those of constraint programming. Integration of the two was initially impeded by their...
A Comparison of CP, IP and Hybrids for Configuration Problems (1999)
Carlsson, Mats, Ottosson, Greger
We investigate different solution techniques for solving a basic part of configuration problems, namely linear arithmetic constraints over integer variables. Approaches include integer programming,...
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...
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...
A Comparison of CP, IP and Hybrids for Configuration Problems (1999)
Mats Carlsson, Greger Ottosson
We investigate different solution techniques for solving a basic part of configuration problems, namely linear arithmetic constraints over integer variables. Approaches include integer programming,...
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...
Worst Case Execution Time Analysis for Modern Hardware Architectures (1997)
Greger Ottosson, Mikael Sjodin
Knowing the worst case execution times (WCETs) for programs are crucial for the design and veri cation of real-time systems. Modern hardware architectures utilize pipelined execution and cache memory...
Using global constraints for frequency allocation (1997)
Greger Ottosson, Mats Carlsson
This report describes an experiment in using a global constraint to improve the performance of the Freplan frequency allocation algorithm for mobile
Effective redundant constraints for online scheduling (1997)
Lise Getoor, Greger Ottosson, Markus Fromherz, Bjorn Carlson
The use of heuristics as a means to improve constraint solver performance has been researched widely. However, most work has been on problem-independent heuristics (e.g., variable and value...
An Open-Ended Finite Domain Constraint Solver (1997)
Mats Carlsson, Greger Ottosson, Björn Carlson
. We describe the design and implementation of a finite domain constraint solver embedded in a Prolog system using an extended unification mechanism via attributed variables as a generic constraint...
Worst Case Execution Time Analysis for Modern Hardware Architectures (1997)
Greger Ottosson, Mikael Sjodin
Knowing the worst case execution times (WCETs) for programs are crucial for the design and verification of real-time systems. Modern hardware architectures utilize pipelined execution and cache...
Worst-Case Execution Time Analysis for Modern Hardware Architectures (1997)
Greger Ottosson, Mikael Sjodin
We present a method for determining the worst case execution time (WCET) for programs running on systems with modern hardware architectures, e.g. pipelined processors and cache memory. The method is...
Effective Redundant Constraints for Online Scheduling (1997)
Lise Getoor, Greger Ottosson, Markus Fromherz, Björn Carlson
The use of heuristics as a means to improve constraint solver performance has been researched widely. However, most work has been on problem-independent heuristics (e.g., variable and value...
Anytime Frequency Allocation with Soft Constraints (1996)
Mats Carlsson Greger, Greger Ottosson
As is well known, the frequency allocation problem for mobile telephone networks can be approximated by a graph coloring problem where vertices model transmitters, colors model frequencies, and an...
Anytime Frequency Allocation with Soft Constraints (1996)
Mats Carlsson, Greger Ottosson
As is well known, the frequency allocation problem for mobile telephone networks can be approximated by a graph coloring problem where vertices model transmitters, colors model frequencies, and an...
Anytime Frequency Allocation with Soft Constraints (1996)
Mats Carlsson Greger, Greger Ottosson
As is well known, the frequency allocation problem for mobile telephone networks can be approximated by a graph coloring problem where vertices model transmitters, colors model frequencies, and an...
An Extension of Erlang with Finite Domain Constraints (1995)
Greger Ottosson Computing, Examensarbete Dv, Greger Ottosson, Ericsson Utvecklings Ab
This report describes the design and implementation of a finite domain constraint solver for Erlang. The constraint solver handles linear arithmetic constraints over natural numbers, which are...
Sim94 - A concurrent simulator for plan-driven troops (1995)
Bjorn Carlson, Bjorn Carlson, Samuel Tronje, Samuel Tronje, Martin Argenius, Calle Bergman, ...
We present the simulation system for plan-driven troops developed at the Computing Science Department, Uppsala University, 1994. This work was performed by the members of Projekt94 in cooperation...
Towards an Open Finite Domain Constraint Solver
Mats Carlsson, Björn Carlson, Greger Ottosson
cation specific constraint solving. (3) An elementary constraint can be linked to a 0/1 variable denoting its truth value. Indexicals are used to define both the constraint solving and the entailment...