218 search results - page 15 / 44 » Strong Bounds Consistencies and Their Application to Linear ... |
CP
2005
Springer
15 years 3 months ago
2005
Springer
In this paper we show how Constraint Programming (CP) techniques can improve the efficiency and applicability of grid-based algorithms for optimising surface contact between comple...
84
Voted
CATS
2008
14 years 12 months ago
2008
We study the consistency problem for extended global cardinality (EGC) constraints. An EGC constraint consists of a set X of variables, a set D of values, a domain D(x) D for eac...
JCO
2010
14 years 8 months ago
2010
We study the extremal parameter N(n, m, H) which is the largest number of copies of a hypergraph H that can be formed of at most n vertices and m edges. Generalizing previous work...
SODA
1998
ACM
14 years 11 months ago
1998
ACM
We describe a new exact-arithmetic approach to linear programming when the number of variables n is much larger than the number of constraints m (or vice versa). The algorithm is ...
122
click to vote
SIAMREV
2010
14 years 5 months ago
2010
The affine rank minimization problem consists of finding a matrix of minimum rank that satisfies a given system of linear equality constraints. Such problems have appeared in the ...