25 search results - page 4 / 5 » cpaior 2010 |
138
click to vote
CPAIOR
2010
Springer
15 years 10 months ago
2010
Springer
This paper introduces the Increasing Nvalue constraint, which restricts the number of distinct values assigned to a sequence of variables so that each variable in the sequence is l...
233
click to vote
CPAIOR
2010
Springer
15 years 3 months ago
2010
Springer
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
155
click to vote
CPAIOR
2010
Springer
15 years 9 months ago
2010
Springer
Cutting plane methods are widely used for solving convex optimization problems and are of fundamental importance, e.g., to provide tight bounds for Mixed-Integer Programs (MIPs). T...
145
click to vote
CPAIOR
2010
Springer
15 years 10 months ago
2010
Springer
Interval coefficients have been introduced in OR and CP to specify uncertain data in order to provide reliable solutions to convex models. The output is generally a solution set, ...
151
click to vote
CPAIOR
2010
Springer
15 years 10 months ago
2010
Springer
In this paper, we present a constraint programming approach for the service consolidation problem that is being currently tackled by Neptuny, Milan. The problem is defined as: Giv...