


default search action
CSCLP 2005: Uppsala, Sweden
- Brahim Hnich, Mats Carlsson, François Fages, Francesca Rossi:

Recent Advances in Constraints, Joint ERCIM/CoLogNET International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2005, Uppsala, Sweden, June 20-22, 2005, Revised Selected and Invited Papers. Lecture Notes in Computer Science 3978, Springer 2006, ISBN 3-540-34215-X
Global Constraints
- Claude-Guy Quimper

, Toby Walsh:
The All Different and Global Cardinality Constraints on Set, Multiset and Tuple Variables. 1-13 - Thom W. Frühwirth:

Complete Propagation Rules for Lexicographic Order Constraints over Arbitrary Domains. 14-28 - Christian Bessiere, Emmanuel Hebrard

, Brahim Hnich
, Zeynep Kiziltan, Toby Walsh:
Among, Common and Disjoint Constraints. 29-43
Search and Heuristics
- Ola Angelsmark, Johan Thapper:

Partitioning Based Algorithms for Some Colouring Problems. 44-58 - Igor Razgon, Amnon Meisels:

A CSP Search Algorithm with Reduced Branching Factor. 59-72 - Richard J. Wallace:

Analysis of Heuristic Synergies. 73-87 - Igor Razgon:

Complexity Analysis of Heuristic CSP Search Algorithms. 88-99
Language and Implementation Issues
- Emmanuel Coquery, François Fages:

A Type System for CHR. 100-117 - Christian Schulte, Guido Tack:

Views and Iterators for Generic Constraint Implementations. 118-132
Modeling
- Armagan Tarim, Ian Miguel

:
A Hybrid Benders' Decomposition Method for Solving Stochastic Constraint Programs with Linear Recourse. 133-148 - Roland Martin:

The Challenge of Exploiting Weak Symmetries. 149-163 - Roman Barták:

On Generators of Random Quasigroup Problems. 164-178

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














