Carlsson, Mats and Ottosson, Greger (1999) A Comparison of CP, IP and Hybrids for Configuration Problems. [SICS Report]
We investigate different solution techniques for solving a basic part of configuration problems, namely linear arithmetic constraints over integer variables. Approaches include integer programming, constraint programming over finite domains and hybrid techniques. We also discuss important extensions of the basic problem and how these can be accommodated in the different solution approaches.
|Item Type:||SICS Report|
|Uncontrolled Keywords:||constraint programming; integer programming; configuration|
|Deposited By:||Vicki Carleson|
|Deposited On:||29 Jul 2009|
|Last Modified:||18 Nov 2009 16:02|
Repository Staff Only: item control page