Change search
ReferencesLink to record
Permanent link

Direct link
A Comparison of CP, IP and Hybrids for Configuration Problems
Number of Authors: 2
1999 (English)Report (Refereed)
Abstract [en]

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
Keyword [en]
constraint programming, integer programming, configuration
National Category
Computer and Information Science
URN: urn:nbn:se:ri:diva-21970OAI: diva2:1041512
Available from: 2016-10-31 Created: 2016-10-31

Open Access in DiVA

fulltext(207 kB)4 downloads
File information
File name FULLTEXT01.pdfFile size 207 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 4 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 4 hits
ReferencesLink to record
Permanent link

Direct link