706 search results - page 12 / 142 » Super Solutions in Constraint Programming |
97
Voted
CSCLP
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. We adopt Benders’ decomposition algorithm to solve scenariobased Stochastic Constraint Programs (SCPs) with linear recourse. Rather than attempting to solve SCPs via a ...
114
click to vote
CC
1998
Springer
15 years 3 months ago
1998
Springer
Abstract. Flow logic offers a compact and versatile notation for expressing the acceptability of solutions to program analysis problems. In contrast to previous logical formulation...
109
Voted
CSCLP
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. Combinatorial problems such as scheduling, resource allocation, and configuration have many attributes that can be subject of user preferences. Traditional optimization ...
MOR
2006
14 years 11 months ago
2006
For a locally optimal solution to the nonlinear semidefinite programming problem, under Robinson's constraint qualification, the following conditions are proved to be equival...
107
click to vote
CP
2003
Springer
15 years 4 months ago
2003
Springer
Constraint programming is a technology which is now widely used to solve combinatorial problems in industrial applications. However, using it requires considerable knowledge and e...