scientific article; zbMATH DE number 2084707

MaRDI QIDQ4475633zbMATH OpenFDO

Authors Nicolas Beldiceanu

Publication date 9 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2239/22390211.htm

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Filtering Algorithms for the NValue Constraint
• Recent Advances in Constraints
• Filtering AtMostNValue with difference constraints: application to the shift minimisation personnel task scheduling problem
• Filtering algorithms for the NValue constraint
• Recent Advances in Constraints

Cited in

(13)

• Filtering AtMostNValue with difference constraints: application to the shift minimisation personnel task scheduling problem
• The complexity of reasoning with global constraints
• Towards constraint-based school timetabling
• Tractability-preserving transformations of global cost functions
• The ROOTS Constraint
• The increasing Nvalue constraint
• Guarantees and limits of preprocessing in constraint satisfaction and reasoning
• Weighted matching as a generic pruning technique applied to optimization constraints
• Recent Advances in Constraints
• Range and Roots: two common patterns for specifying and propagating counting and occurrence constraints
• 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

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4475633)