Syndetics cover image
Image from Syndetics

Recent Advances in Constraints [electronic resource] : 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 / edited by Brahim Hnich, Mats Carlsson, Francois Fages, Francesca Rossi.

Contributor(s): Material type: TextSeries: Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2006Edition: 1st ed. 2006Description: VIII, 179 p. online resourceContent type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9783540342168
Subject(s): DDC classification:
  • 338.47004 23
Online resources:
Contents:
Global Constraints -- The All Different and Global Cardinality Constraints on Set, Multiset and Tuple Variables -- Complete Propagation Rules for Lexicographic Order Constraints over Arbitrary Domains -- Among, Common and Disjoint Constraints -- Search and Heuristics -- Partitioning Based Algorithms for Some Colouring Problems -- A CSP Search Algorithm with Reduced Branching Factor -- Analysis of Heuristic Synergies -- Complexity Analysis of Heuristic CSP Search Algorithms -- Language and Implementation Issues -- A Type System for CHR -- Views and Iterators for Generic Constraint Implementations -- Modeling -- A Hybrid Benders’ Decomposition Method for Solving Stochastic Constraint Programs with Linear Recourse -- The Challenge of Exploiting Weak Symmetries -- On Generators of Random Quasigroup Problems.
No physical items for this record

Global Constraints -- The All Different and Global Cardinality Constraints on Set, Multiset and Tuple Variables -- Complete Propagation Rules for Lexicographic Order Constraints over Arbitrary Domains -- Among, Common and Disjoint Constraints -- Search and Heuristics -- Partitioning Based Algorithms for Some Colouring Problems -- A CSP Search Algorithm with Reduced Branching Factor -- Analysis of Heuristic Synergies -- Complexity Analysis of Heuristic CSP Search Algorithms -- Language and Implementation Issues -- A Type System for CHR -- Views and Iterators for Generic Constraint Implementations -- Modeling -- A Hybrid Benders’ Decomposition Method for Solving Stochastic Constraint Programs with Linear Recourse -- The Challenge of Exploiting Weak Symmetries -- On Generators of Random Quasigroup Problems.

Licensed e-book