2109 search results - page 76 / 422 » Solving Necklace Constraint Problems |
165
click to vote
SODA
2010
ACM
15 years 3 months ago
2010
ACM
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
167
click to vote
INFORMS
1998
15 years 4 months ago
1998
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
123
click to vote
CEC
2008
IEEE
15 years 11 months ago
2008
IEEE
In this paper we introduce an evolutionary algorithm for solving a copper mine planning problem. In the last 10 years this realworld problem has been tackled using linear integer p...
127
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Programs to solve so-called constraint problems are complex pieces of software which require many design decisions to be made more or less arbitrarily by the implementer. These dec...
137
click to vote
CPAIOR
2009
Springer
15 years 11 months ago
2009
Springer
Many real-world problems require the enumeration of all solutions of combinatorial search problems, even though this is often infeasible in practice. However, not always all parts ...