Cost-based domain filtering for stochastic constraint programming

R. Rossi, S. Prestwich, S.A. Tarim, B. Hnich

Research output: Chapter in Book/Report/Conference proceedingChapter (peer-reviewed)peer-review


Cost-based filtering is a novel approach that combines techniques from Operations Research and Constraint Programming to filter from decision variable domains values that do not lead to better solutions [7]. Stochastic Constraint Programming is a framework for modeling combinatorial optimization problems that involve uncertainty [9]. In this work, we show how to perform cost-based filtering for certain classes of stochastic constraint programs. Our approach is based on a set of known inequalities borrowed from Stochastic Programming - a branch of OR concerned with modeling and solving problems involving uncertainty. We discuss bound generation and cost-based domain filtering procedures for a well-known problem in the Stochastic Programming literature, the static stochastic knapsack problem. We also apply our technique to a stochastic sequencing problem. Our results clearly show the value of the proposed approach over a pure scenario-based Stochastic Constraint Programming formulation both in terms of explored nodes and run times.
Original languageEnglish
Title of host publicationPrinciples and Practice of Constraint Programming
Subtitle of host publication14th International Conference, CP 2008, Sydney, Australia, September 14-18, 2008. Proceedings
EditorsPeter J. Stuckey
PublisherSpringer-Verlag GmbH
Number of pages16
Volume5202 LNCS
ISBN (Print)978-3-540-85957-4
Publication statusPublished - 22 Sep 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Berlin / Heidelberg
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Fingerprint Dive into the research topics of 'Cost-based domain filtering for stochastic constraint programming'. Together they form a unique fingerprint.

Cite this