706 search results - page 23 / 142 » Super Solutions in Constraint Programming |
CP
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. In many situations, a set of hard constraints encodes the feasible configurations of some system or product over which users have preferences. We consider the problem of...
CP
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. We introduce a new approach for focusing constraint reasoning using so-called streamlining constraints. Such constraints partition the solution space to drive the search ...
ASPDAC
1999
ACM
15 years 4 months ago
1999
ACM
We present an algorithm for solving a general min-cut, twoway partitioning problem subject to timing constraints. The problem is formulated as a constrained programming problem an...
CP
2009
Springer
15 years 6 months ago
2009
Springer
In this paper we present a hybrid model for the demand acceptance variant of the routing and wavelength assignment problem in directed networks, an important benchmark problem in o...
103
click to vote
IPCO
2008
15 years 1 months ago
2008
Orbital branching is a method for branching on variables in integer programming that reduces the likelihood of evaluating redundant, isomorphic nodes in the branch-and-bound proce...