2864 search results - page 66 / 573 » Constraint Programming in OPL |
ICLP
2007
Springer
14 years 3 months ago
2007
Springer
ICLP
2007
Springer
14 years 3 months ago
2007
Springer
IPCO
2007
13 years 10 months ago
2007
Consider an integer program max(ct x : Ax = b, x ≥ 0, x ∈ Zn ) where A ∈ Zm×n , b ∈ Zm , and c ∈ Zn . We show that the integer program can be solved in pseudo-polynomial...
POPL
1995
ACM
14 years 16 days ago
1995
ACM
d Abstract) We extend the model of [VRV94] to express strong time-outs (and pre-emption): if an event A does not happen through time t, cause event B to happen at time t. Such con...
CP
2006
Springer
14 years 22 days ago
2006
Springer
Abstract. We extend the common depth-first backtrack search for constraint satisfaction problems with randomized variable and value selection. The resulting methods are applied to ...