592 search results - page 16 / 119 » Using Constraint Programming to Solve the Maximum Clique Pro... |
71
Voted
SAS
2001
Springer
15 years 1 months ago
2001
Springer
This paper describes the precise speci cation, design, analysis, implementation, and measurements of an e cient algorithm for solving regular tree grammar based constraints. The p...
76
Voted
ICTAI
2008
IEEE
15 years 4 months ago
2008
IEEE
Boolean satisfiability (SAT) finds a wide range of practical applications, including Artificial Intelligence and, more recently, Bioinformatics. Although encoding some combinat...
70
Voted
CP
2005
Springer
15 years 3 months ago
2005
Springer
One of the critical problems in the call center industries is the staffing problem since they must face variable demands and because staff costs represent a major part of the cost...
105
click to vote
WLP
2004
Springer
15 years 2 months ago
2004
Springer
Constraint programming provides a declarative approach to solving combinatorial (optimization) problems. The user just states the problem as a constraint satisfaction problem (CSP)...
67
Voted
STOC
1995
ACM
15 years 1 months ago
1995
ACM
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...