13841 search results - page 230 / 2769 » Algorithms and Constraint Programming |
183
click to vote
JSAT
2006
15 years 6 months ago
2006
Cutting planes are a well-known, widely used, and very effective technique for Integer Linear Programming (ILP). However, cutting plane techniques are seldom used in PseudoBoolean...
147
click to vote
SAS
2005
Springer
16 years 2 days ago
2005
Springer
Abstract. We introduce Banshee, a toolkit for constructing constraintbased analyses. Banshee’s novel features include a code generator for creating customized constraint resoluti...
182
click to vote
COCOA
2008
Springer
15 years 7 months ago
2008
Springer
Solution symmetries in integer linear programs often yield long Branch-and-Bound based solution processes. We propose a method for finding elements of the permutation group of sol...
240
click to vote
ICLP
2011
Springer
14 years 10 months ago
2011
Springer
In high-level constraint modelling languages, constraints can occur in non-Boolean contexts: implicitly, in the form of partial functions, or more explicitly, in the form of const...
263
click to vote
CP
2009
Springer
16 years 7 months ago
2009
Springer
Measuring graph similarity is a key issue in many applications. We propose a new constraint-based modeling language for defining graph similarity measures by means of constraints. ...