Results 1  10
of
111,679
Detecting cardinality constraints in CNF
"... Abstract. We present novel approaches to detect cardinality constraints expressed in CNF. The first approach is based on a syntactic analysis of specific data structures used in SAT solvers to represent binary and ternary clauses, whereas the second approach is based on a semantic analysis by unit p ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
Abstract. We present novel approaches to detect cardinality constraints expressed in CNF. The first approach is based on a syntactic analysis of specific data structures used in SAT solvers to represent binary and ternary clauses, whereas the second approach is based on a semantic analysis by unit
Symmetric Cardinality Constraint with Costs
, 2004
"... The symmetric cardinality constraint is described in terms of a set of variables X = {x1 , . . . , xk}, which take their values as subsets of V = {v1 , . . . , vn}. It constraints the cardinality of the set assigned to each variable to be in an interval [l x i , ux i ] and at the same time it ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
The symmetric cardinality constraint is described in terms of a set of variables X = {x1 , . . . , xk}, which take their values as subsets of V = {v1 , . . . , vn}. It constraints the cardinality of the set assigned to each variable to be in an interval [l x i , ux i ] and at the same time
Improved algorithms for the global cardinality constraint
 In Proceedings CP’04
, 2004
"... Abstract. We study the global cardinality constraint (gcc) and propose an O(n ..."
Abstract

Cited by 37 (3 self)
 Add to MetaCart
Abstract. We study the global cardinality constraint (gcc) and propose an O(n
THE COMPLEXITY OF GLOBAL CARDINALITY CONSTRAINTS
"... ABSTRACT. In a constraint satisfaction problem (CSP) the goal is to find an assignment of a given set of variables subject to specified constraints. A global cardinality constraint is an additional requirement that prescribes how many variables must be assigned a certain value. We study the complexi ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
ABSTRACT. In a constraint satisfaction problem (CSP) the goal is to find an assignment of a given set of variables subject to specified constraints. A global cardinality constraint is an additional requirement that prescribes how many variables must be assigned a certain value. We study
Combination of among and cardinality constraints
 Proceedings of the Second International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2005), volume 3524 of Lecture Notes in Computer Science
, 2005
"... Abstract. A cardinality constraint imposes that each value of a set V must be taken a certain number of times by a set of variables X, whereas an among constraint imposes that a certain number of variables of a set X must take a value in the set V. This paper studies several combinations of among co ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
Abstract. A cardinality constraint imposes that each value of a set V must be taken a certain number of times by a set of variables X, whereas an among constraint imposes that a certain number of variables of a set X must take a value in the set V. This paper studies several combinations of among
LOGIC PROGRAMMING WITH CARDINALITY CONSTRAINTS
, 2003
"... In this work we examine cardinality constraint logic programs. We give a formal definition of the stable model semantics for general cardinality constraint programs and define a syntactic subclass of them, omegarestricted programs, that stays decidable even when function symbols are used. We show t ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In this work we examine cardinality constraint logic programs. We give a formal definition of the stable model semantics for general cardinality constraint programs and define a syntactic subclass of them, omegarestricted programs, that stays decidable even when function symbols are used. We show
Submodular Maximization with Cardinality Constraints
"... We consider the problem of maximizing a (nonmonotone) submodular function subject to a cardinality constraint. In addition to capturing wellknown combinatorial optimization problems, e.g., MaxkCoverage and MaxBisection, this problem has applications in other more practical settings such as nat ..."
Abstract
 Add to MetaCart
We consider the problem of maximizing a (nonmonotone) submodular function subject to a cardinality constraint. In addition to capturing wellknown combinatorial optimization problems, e.g., MaxkCoverage and MaxBisection, this problem has applications in other more practical settings
Adding cardinality constraints to integer . . .
, 2007
"... MaxSATCC is the following optimization problem: Given a formula in CNF and a bound k, find an assignment with at most k variables being set to true that maximizes the number of satisfied clauses among all such assignments. If each clause is restricted to have at most ℓ literals, we obtain the prob ..."
Abstract
 Add to MetaCart
ℓSATCC. We answer this question in the affirmative by presenting a randomized approximation algorithm whose approximation ratio is 1−(1 − 1 ℓ)ℓ −ε. To do this, we develop a general technique for adding a cardinality constraint to certain integer programs. Our algorithm can be derandomized using pairwise
Generalized Arc Consistency for Global Cardinality Constraint
"... A global cardinality constraint (gcc) is specified in terms of a set of variables X = fx1 ; :::; xpg which take their values in a subset of V = fv1 ; :::; vdg. It constrains the number of times a value v i 2 V is assigned toavariable in X to be in an interval (l i ;c i ). Cardinality constraints hav ..."
Abstract

Cited by 207 (10 self)
 Add to MetaCart
A global cardinality constraint (gcc) is specified in terms of a set of variables X = fx1 ; :::; xpg which take their values in a subset of V = fv1 ; :::; vdg. It constrains the number of times a value v i 2 V is assigned toavariable in X to be in an interval (l i ;c i ). Cardinality constraints
Submodular Maximization with Cardinality Constraints
"... We consider the problem of maximizing a (nonmonotone) submodular function subject to a cardinality constraint. In addition to capturing wellknown combinatorial optimization problems, e.g., MaxkCoverage and MaxBisection, this problem has applications in other more practical settings such as nat ..."
Abstract
 Add to MetaCart
We consider the problem of maximizing a (nonmonotone) submodular function subject to a cardinality constraint. In addition to capturing wellknown combinatorial optimization problems, e.g., MaxkCoverage and MaxBisection, this problem has applications in other more practical settings
Results 1  10
of
111,679