63 search results - page 3 / 13 » cp 2004 |
CP
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. We study the global cardinality constraint (gcc) and pro
CP
2004
Springer
13 years 10 months ago
2004
Springer
In this talk we present a number of problems for network design, planning and analysis and show how they can be addressed with different hybrid CP solutions. Clearly, this problem...
COMBINATORICA
2004
13 years 5 months ago
2004
Let p [1, [ and cp = maxa[0,1]((1 - a)ap + a(1 - a)p)1/p. We prove that the known upper bound lindiscp(A) cp for the Lp linear discrepancy of a totally unimodular matrix A is as...
CP
2004
Springer
13 years 9 months ago
2004
Springer
This paper presents an algorithm that achieves hyper-arc consistency for the soft alldifferent constraint. To this end, we prove and exploit the equivalence with a minimum-cost flo...
CP
2004
Springer
13 years 10 months ago
2004
Springer
The contribution of this paper is in demonstrating the impact of AND/OR search spaces view on solutions counting. In contrast to the traditional (OR) search space view, the AND/OR ...