The following pages link to (Q4475633):
Displayed 10 items.
- Tractability-preserving transformations of global cost functions (Q309935) (← links)
- Guarantees and limits of preprocessing in constraint satisfaction and reasoning (Q460604) (← links)
- Weighted matching as a generic pruning technique applied to optimization constraints (Q490152) (← links)
- Range and Roots: two common patterns for specifying and propagating counting and occurrence constraints (Q840817) (← links)
- Reformulation of global constraints based on constraints checkers (Q850448) (← links)
- Filtering algorithms for the NValue constraint (Q857887) (← links)
- New filtering for \textsc{AtMostNValue} and its weighted variant: a Lagrangian approach (Q890005) (← links)
- Filtering AtMostNValue with difference constraints: application to the shift minimisation personnel task scheduling problem (Q2453730) (← links)
- The complexity of reasoning with global constraints (Q2454812) (← links)
- Towards constraint-based school timetabling (Q2468741) (← links)