Pages that link to "Item:Q5897227"
From MaRDI portal
The following pages link to Principles and Practice of Constraint Programming – CP 2003 (Q5897227):
Displayed 14 items.
- Tractability-preserving transformations of global cost functions (Q309935) (← links)
- Solving subgraph isomorphism problems with constraint programming (Q606895) (← links)
- Undirected forest constraints (Q846145) (← links)
- The TV-break packing problem (Q853012) (← links)
- Global constraint catalogue: past, present and future (Q879974) (← links)
- A parametric filtering algorithm for the graph isomorphism problem (Q1020495) (← links)
- Modeling uncertainties with chance constraints (Q1616391) (← links)
- How efficient is a global constraint in practice? A fair experimental framework (Q1706598) (← links)
- Global domain views for expressive and cross-domain constraint programming (Q2152270) (← links)
- Consistency techniques for polytime linear global cost functions in weighted constraint satisfaction (Q2342595) (← links)
- The complexity of reasoning with global constraints (Q2454812) (← links)
- Bounds of graph parameters for global constraints (Q3534209) (← links)
- Combining Two Structured Domains for Modeling Various Graph Matching Problems (Q5302726) (← links)
- Generic Constraint-based Block Modeling using Constraint Programming (Q5856475) (← links)