Sciweavers

CP
2005
Springer

Using Constraint Programming for Solving Distance CSP with Uncertainty

14 years 4 months ago
Using Constraint Programming for Solving Distance CSP with Uncertainty
Many problems in chemistry, robotics or molecular biology can be expressed as a Distance CSP4 . In this paper, we propose a specific methodology for tackling uncertainties in this class of problems. The main idea consists in solving the CSP without taking into account the uncertainties and using this information to approximate the solution space of the original CSP. This methodology permits to obtain an interior and exterior approximation of each solution sub-space by a set of disjoint boxes.
Carlos Grandón, Bertrand Neveu
Added 26 Jun 2010
Updated 26 Jun 2010
Type Conference
Year 2005
Where CP
Authors Carlos Grandón, Bertrand Neveu
Comments (0)