1378 search results - page 55 / 276 » The Tractability of Global Constraints |
204
click to vote
COCOS
2003
Springer
15 years 11 months ago
2003
Springer
We investigate some approaches to solving nonconvex global optimization problems by convex nonlinear programming methods. We assume that the problem becomes convex when selected va...
171
click to vote
MP
2008
15 years 6 months ago
2008
Abstract. We study piecewise decomposition methods for mathematical programs with equilibrium constraints (MPECs) for which all constraint functions are linear. At each iteration o...
174
click to vote
AI
2003
Springer
15 years 11 months ago
2003
Springer
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complet...
166
click to vote
CONSTRAINTS
2006
15 years 6 months ago
2006
Constraint satisfaction problems (CSPs) sometimes contain both variable symmetries and value symmetries, causing adverse effects on CSP solvers based on tree search. As a remedy, s...
261
click to vote
CP
2009
Springer
16 years 6 months ago
2009
Springer
Abstract. This paper introduces a generalization of the nvalue constraint that bounds the number of distinct values taken by a set of variables.The generalized constraint (called n...