@inbook{2122610cd0d5464d9ada25347b1ac83d,
title = "Branching constraint satisfaction problems for solutions robust under likely changes",
abstract = "Many applications of CSPs require partial solutions to be found before all the information about the problem is available. We examine the case where the future is partially known, and where it is important to make decisions in the present that will be robust in the light of future events. We introduce the branching CSP to model these situations, incorporating some elements of decision theory, and describe an algorithm for its solution that combines forward checking with branch and bound search. We also examine a simple thresholding method which can be used in conjunction with the forward checking algorithm, and we show the trade-off between time and solution quality.",
author = "Fowler, \{David W.\} and Brown, \{Kenneth N.\}",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2000.; 6th International Conference on Principles and Practice of Constraint Programming, CP2000 ; Conference date: 18-09-2000 Through 21-09-2000",
year = "2000",
doi = "10.1007/3-540-45349-0\_38",
language = "English",
isbn = "3540410538",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "500--504",
editor = "Rina Dechter",
booktitle = "Principles and Practice of Constraint Programming - CP 2000 - 6th International Conference, CP 2000, Proceedings",
address = "Germany",
}