A Comparison of CP, IP and Hybrids for Configuration Problems
Number of Authors: 2
1999 (English)Report (Refereed)
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.
Place, publisher, year, edition, pages
Kista, Sweden: Swedish Institute of Computer Science , 1999, 1. , 14 p.
SICS Technical Report, ISSN 1100-3154 ; T99:04
constraint programming, integer programming, configuration
Computer and Information Science
IdentifiersURN: urn:nbn:se:ri:diva-21970OAI: oai:DiVA.org:ri-21970DiVA: diva2:1041512