Sciweavers

WLP
2004
Springer
14 years 4 months ago
Effective Modeling with Constraints
Constraint programming provides a declarative approach to solving combinatorial (optimization) problems. The user just states the problem as a constraint satisfaction problem (CSP)...
Roman Barták
PATAT
2004
Springer
148views Education» more  PATAT 2004»
14 years 4 months ago
Interactively Solving School Timetabling Problems Using Extensions of Constraint Programming
Timetabling problems have been frequently studied due to their wide range of applications. However, they are often solved manually because of the lack of appropriate computer tools...
Hadrien Cambazard, Fabien Demazeau, Narendra Jussi...
CSCLP
2004
Springer
14 years 4 months ago
A Note on Bilattices and Open Constraint Programming
Abstract. We propose to use bilattice as a constraint valuation structure in order to represent truth and belief at the same time. A bilattice is a set which owns two lattices orde...
Arnaud Lallouet
CPAIOR
2004
Springer
14 years 4 months ago
Stabilization Issues for Constraint Programming Based Column Generation
Abstract. Constraint programming based column generation is a hybrid optimization framework recently proposed that uses constraint programming (CP) to solve column generation subpr...
Louis-Martin Rousseau
CP
2004
Springer
14 years 4 months ago
A Hybrid Method for Planning and Scheduling
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve planning and scheduling problems. Tasks are allocated to facilities using MILP and sche...
John N. Hooker
CP
2004
Springer
14 years 4 months ago
Constraint-Based Combinators for Local Search
Abstract. One of the most appealing features of constraint programming is its rich constraint language for expressing combinatorial optimization problems. This paper demonstrates t...
Pascal Van Hentenryck, Laurent Michel, Liyuan Liu
CP
2004
Springer
14 years 4 months ago
The Tractability of Global Constraints
Abstract. Constraint propagation is one of the techniques central to the success of constraint programming. Fast algorithms are used to prune the search space either before or duri...
Christian Bessière, Emmanuel Hebrard, Brahi...
CP
2004
Springer
14 years 4 months ago
Leveraging the Learning Power of Examples in Automated Constraint Acquisition
Constraint programming is rapidly becoming the technology of choice for modeling and solving complex combinatorial problems. However, users of constraint programming technology nee...
Christian Bessière, Remi Coletta, Eugene C....
ICCBR
2005
Springer
14 years 4 months ago
Using CBR to Select Solution Strategies in Constraint Programming
Constraint programming is a powerful paradigm that offers many different strategies for solving problems. Choosing a good strategy is difficult; choosing a poor strategy wastes r...
Cormac Gebruers, Brahim Hnich, Derek G. Bridge, Eu...
ECML
2005
Springer
14 years 5 months ago
A SAT-Based Version Space Algorithm for Acquiring Constraint Satisfaction Problems
Constraint programming is rapidly becoming the technology of choice for modelling and solving complex combinatorial problems. However, users of this technology need significant ex...
Christian Bessière, Remi Coletta, Fré...