CP
2005
Springer
14 years 5 months ago
2005
Springer
Abstract. We present an incomplete filtering algorithm for the circuit constraint. The filter removes redundant values by eliminating nonHamiltonian edges from the associated gra...
CP
2005
Springer
14 years 5 months ago
2005
Springer
CP
2005
Springer
14 years 5 months ago
2005
Springer
Methods exploiting tree-decompositions seem to provide the best approach for solving constraint networks w.r.t. the theoretical time complexity. However, they have not shown a real...
CP
2005
Springer
14 years 5 months ago
2005
Springer
Abstract. In recent years, dynamic local search (DLS) clause weighting algorithms have emerged as the local search state-of-the-art for solving propositional satisfiability proble...
CP
2005
Springer
14 years 5 months ago
2005
Springer
Abstract. Most CSP algorithms are based on refinements and extensions of backtracking, and employ one of two simple “branching schemes”: 2-way branching or d-way branching, fo...
CP
2005
Springer
14 years 5 months ago
2005
Springer
Abstract. The heavy-tailed phenomenon that characterises the runtime distributions of backtrack search procedures has received considerable attention over the past few years. Some ...
CP
2005
Springer
14 years 5 months ago
2005
Springer
The aggregation of individuals’ preferences into a single group outcome is both well-studied and fundamental within decision theory. Historically, though, a pervasive simplifica...
CP
2005
Springer
14 years 5 months ago
2005
Springer
Abstract. Subquadrangles are a natural way in which to represent constraints as they do not restrict any subset of their scope. There are already known methods for converting any g...
CP
2005
Springer
14 years 5 months ago
2005
Springer
We combine mixed integer linear programming (MILP) and constraint programming (CP) to minimize tardiness in planning and scheduling. Tasks are allocated to facilities using MILP an...
CP
2005
Springer
14 years 5 months ago
2005
Springer
There is no unified modeling standard available to the CP community, so constraint programs can not be developed independently from the used CP library. Without such standard, CP ...