scientific article; zbMATH DE number 2084707
From MaRDI portal
Publication:4475633
zbMath1067.68611MaRDI QIDQ4475633
Publication date: 9 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2239/22390211.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (10)
Range and Roots: two common patterns for specifying and propagating counting and occurrence constraints ⋮ Tractability-preserving transformations of global cost functions ⋮ Reformulation of global constraints based on constraints checkers ⋮ Filtering algorithms for the NValue constraint ⋮ New filtering for \textsc{AtMostNValue} and its weighted variant: a Lagrangian approach ⋮ Guarantees and limits of preprocessing in constraint satisfaction and reasoning ⋮ Filtering AtMostNValue with difference constraints: application to the shift minimisation personnel task scheduling problem ⋮ The complexity of reasoning with global constraints ⋮ Weighted matching as a generic pruning technique applied to optimization constraints ⋮ Towards constraint-based school timetabling
This page was built for publication:
