Propagating Knapsack Constraints in Sublinear Time.
|
AAAI |
2007 |
12 |
The "Not-Too-Heavy Spanning Tree" Constraint.
|
CPAIOR |
2007 |
19 |
Expected-Case Analysis for Delayed Filtering.
|
CPAIOR |
2006 |
19 |
Undirected Forest Constraints.
|
CPAIOR |
2006 |
9 |
The
|
CP |
2006 |
0 |
Multiconsistency and Robustness with Global Constraints.
|
CPAIOR |
2005 |
3 |
Maintaining Longest Paths in Cyclic Graphs.
|
CP |
2005 |
3 |
Sub-optimality Approximations.
|
CP |
2005 |
13 |
Filtering Algorithms for the Same Constraint.
|
CPAIOR |
2004 |
25 |
Dynamic Heaviest Paths in DAGs with Arbitrary Edge Weights.
|
CPAIOR |
2004 |
4 |
Fast Bound Consistency for the Global Cardinality Constraint.
|
CP |
2003 |
26 |