706 search results - page 110 / 142 » Super Solutions in Constraint Programming |
DISOPT
2007
14 years 11 months ago
2007
The class Max (r, 2)-CSP (or simply Max 2-CSP) consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m bin...
MOR
2002
14 years 11 months ago
2002
We present a polyhedral study of the complementarity knapsack problem. Traditionally, complementarity constraints are modeled by introducing auxiliary binary variables and additio...
CP
2007
Springer
15 years 6 months ago
2007
Springer
Symmetry is an important factor in solving many constraint satisfaction problems. One common type of symmetry is when we have symmetric values. We can eliminate such value symmetr...
GECCO
2007
Springer
15 years 6 months ago
2007
Springer
In this paper, we propose a new approach that consists of the extended compact genetic algorithm (ECGA) and split-ondemand (SoD), an adaptive discretization technique, to economic...
ISCC
2005
IEEE
15 years 5 months ago
2005
IEEE
This study deals with the Delay-Constrained Minimum Cost Loop Problem (DC-MCLP) of finding several loops from a source node. The DC-MCLP consists of finding a set of minimum cost ...