CP
2004
Springer
14 years 5 months ago
2004
Springer
CP
2004
Springer
14 years 5 months ago
2004
Springer
In real-life temporal scenarios, uncertainty and preferences are often essential, coexisting aspects. We present a formalism where temporal constraints with both preferences and un...
CP
2004
Springer
14 years 5 months ago
2004
Springer
Cardinality matrix problems are the underlying structure of several real world problems such as rostering, sports scheduling , and timetabling. These are hard computational problem...
CP
2004
Springer
14 years 5 months ago
2004
Springer
Abstract. We study the global cardinality constraint (gcc) and pro
CP
2004
Springer
14 years 5 months ago
2004
Springer
This paper considers the problem of transforming a resource feasible, fixed-times schedule into a partial order schedule (POS) to enhance its robustness and stability properties. ...
CP
2004
Springer
14 years 5 months ago
2004
Springer
It is well known that the ratio of the number of clauses to the number of variables in a random k-SAT instance is highly correlated with the instance’s empirical hardness. We con...
CP
2004
Springer
14 years 5 months ago
2004
Springer
CP
2004
Springer
14 years 5 months ago
2004
Springer
CP
2004
Springer
14 years 5 months ago
2004
Springer
We study the quality of LP-based approximation methods for pure combinatorial problems. We found that the quality of the LPrelaxation is a direct function of the underlying constra...
CP
2004
Springer
14 years 5 months ago
2004
Springer
The paper introduces value precedence on integer and set sequences. A useful application of the notion is in breaking symmetries of indistinguishable values, an important class of ...