Sciweavers

805 search results - page 28 / 161
» Enumerating All Solutions for Constraint Satisfaction Proble...
Sort
View
FLAIRS
2008
13 years 10 months ago
Conditional and Composite Constraints with Preferences
Preferences in constraint problems are common but significant in many real world applications. In this paper, we extend our conditional and composite CSP (CCCSP) framework, managi...
Malek Mouhoub, Amrudee Sukpan
CCE
2007
13 years 8 months ago
Generate Pareto optimal solutions of scheduling problems using normal boundary intersection technique
The problem of short-term scheduling under uncertainty is addressed in this paper through a multiobjective optimization framework that incorporates economic expectation, robustnes...
Zhenya Jia, Marianthi G. Ierapetritou
IJCAI
2003
13 years 9 months ago
A Fast and Simple Algorithm for Bounds Consistency of the AllDifferent Constraint
In constraint programming one models a problem by stating constraints on acceptable solutions. The constraint model is then usually solved by interleaving backtracking search and ...
Alejandro López-Ortiz, Claude-Guy Quimper, ...
CP
2006
Springer
14 years 6 days ago
Constraint Satisfaction with Bounded Treewidth Revisited
Abstract. The constraint satisfaction problem can be solved in polynomial time for instances where certain parameters (e.g., the treewidth of primal graphs) are bounded. However, t...
Marko Samer, Stefan Szeider
COCOA
2007
Springer
14 years 2 months ago
On Threshold BDDs and the Optimal Variable Ordering Problem
Abstract. Many combinatorial optimization problems can be formulated as 0/1 integer programs (0/1 IPs). The investigation of the structure of these problems raises the following ta...
Markus Behle