ITU

Combining Binary Decision Diagrams and Backtracking Search for Scalable Backtrack-Free Interactive Product Configuration

Research output: Conference Article in Proceeding or Book/Report chapterArticle in proceedingsResearchpeer-review

View graph of relations

This paper demonstrates how to lower the average response time of search-based interactive configurators using over and under approximations of the configuration problem represented by binary decision diagrams (BDDs) on problems where fast configurators using monolithic BDDs are intractable. The paper introduces several ways to build the approximations and our experimental evaluation on industrial data shows that a search driven extension of the approximations substantially outperforms both purely search-based and purely BDDbased interactive configurators.

Original languageEnglish
Title of host publicationProceedings of the 21st International Joint Conferences on Artificial Intelligence (IJCAI-09) Workshop on Configuration
PublisherAAAI Press
Publication date2009
Publication statusPublished - 2009
Event21st International Joint Conferences on Artificial Intelligence (IJCAI-09) Workshop on Configuration - Pasadena, California, United States
Duration: 11 Jul 200917 Jul 2009

Conference

Conference21st International Joint Conferences on Artificial Intelligence (IJCAI-09) Workshop on Configuration
LandUnited States
ByPasadena, California
Periode11/07/200917/07/2009

Downloads

No data available

ID: 1019297