706 search results - page 11 / 142 » Super Solutions in Constraint Programming |
170
click to vote
CP
2009
Springer
16 years 9 days ago
2009
Springer
This paper deals with the challenging problem of counting the number of solutions of a CSP, denoted #CSP. Recent progress have been made using search methods, such as BTD [15], whi...
116
Voted
CP
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. In this paper, we present a constraint-partitioning approach for finding local optimal solutions of large-scale mixed-integer nonlinear programming problems (MINLPs). Ba...
117
click to vote
WLP
2004
Springer
15 years 5 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)...
CORR
2008
Springer
14 years 11 months ago
2008
Springer
Determining the evolutionary history of a given biological data is an important task in biological sciences. Given a set of quartet topologies over a set of taxa, the Maximum Quart...
77
Voted
CP
2006
Springer
15 years 3 months ago
2006
Springer
We study a family of problems, called Maximum Solution, where the objective is to maximise a linear goal function over the feasible integer assignments to a set of variables subjec...