Sciweavers

2974 search results - page 106 / 595
» Model-Driven Constraint Programming
Sort
View
COCOA
2008
Springer
15 years 7 months ago
Automatic Generation of Symmetry-Breaking Constraints
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...
Leo Liberti
EOR
2007
80views more  EOR 2007»
15 years 6 months ago
Exploiting nested inequalities and surrogate constraints
The exploitation of nested inequalities and surrogate constraints as originally proposed in Glover [Glover, F., 1965. A multiphase-dual algorithm for the zero–one integer progra...
Saïd Hanafi, Fred Glover
ICLP
2011
Springer
14 years 9 months ago
Constraints in Non-Boolean Contexts
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...
Leslie De Koninck, Sebastian Brand, Peter J. Stuck...
ICFP
2008
ACM
16 years 6 months ago
From ML to MLF: graphic type constraints with efficient type inference
MLF is a type system that seamlessly merges ML-style type inference with System-F polymorphism. We propose a system of graphic (type) constraints that can be used to perform type ...
Boris Yakobowski, Didier Rémy
ICAI
2010
15 years 4 months ago
Constraint-Based Dogleg Channel Routing with Via Minimization
- In this article, we present an algorithm which is capable of transforming a gridded dogleg channel routing problem into a constraint programming (CP) problem. The transformed CP ...
I-Lun Tseng, Huan-Wen Chen, Che-I Lee, Adam Postul...