53 search results - page 1 / 11 » Automatically Exploiting Subproblem Equivalence in Constrain... |
CPAIOR
2010
Springer
13 years 2 months ago
2010
Springer
Many search problems contain large amounts of redundancy in the search. In this paper we examine how to automatically exploit remaining subproblem equivalence, which arises when tw...
POPL
2010
ACM
13 years 9 months ago
2010
ACM
The availability of commodity multi-core and multi-processor machinesandtheinherentparallelisminconstraintprogrammingsearchoffer significant opportunities for constraint programmi...
CP
2005
Springer
13 years 9 months ago
2005
Springer
Abstract. In this paper, we present a constraint-partitioning approach for finding local optimal solutions of large-scale mixed-integer nonlinear programming problems (MINLPs). Ba...
CSCLP
2004
Springer
13 years 9 months ago
2004
Springer
We introduce a framework for studying and solving a class of CSP formulations. The framework allows constraints to be expressed as linear and nonlinear equations, then compiles th...
CP
1999
Springer
13 years 8 months ago
1999
Springer
Column generation is a state-of-the-art method for optimally solving di cult large-scale optimization problems such as airline crew assignment. We show how to apply column generati...