The following pages link to (Q4254883):
Displayed 23 items.
- Recognizing frozen variables in constraint satisfaction problems (Q706617) (← links)
- Scheduling and routing of automated guided vehicles: A hybrid approach (Q858276) (← links)
- A new generic scheme for functional logic programming with constraints (Q880985) (← links)
- A unified theory of structural tractability for constraint satisfaction problems (Q931717) (← links)
- Memetic algorithm timetabling for non-commercial sport leagues. (Q1417496) (← links)
- Mixed global constraints and inference in hybrid CLP--IP solvers (Q1601927) (← links)
- Backjump-based backtracking for constraint satisfaction problems (Q1605408) (← links)
- Detection of the discrete convexity of polyominoes (Q1861555) (← links)
- Logic programming with solution preferences (Q2378282) (← links)
- Integrated production and material handling scheduling using mathematical programming and constraint programming (Q2433554) (← links)
- An analysis of arithmetic constraints on integer intervals (Q2460254) (← links)
- Automatic generation of redundant models for permutation constraint satisfaction problems (Q2460256) (← links)
- Towards constraint-based school timetabling (Q2468741) (← links)
- Constraint and Logic Programming: Ugo Montanari’s Main Contributions and Introduction to the Volume Section (Q3507362) (← links)
- Semiring-Based Soft Constraints (Q3507363) (← links)
- TCHR: a framework for tabled CLP (Q3514891) (← links)
- Placement Inference for a Client-Server Calculus (Q3520305) (← links)
- Propagation = Lazy Clause Generation (Q3523077) (← links)
- Three perspectives for solving the job grouping problem (Q4443354) (← links)
- (Q4506060) (← links)
- Solving nesting problems with non-convex polygons by constraint logic programming (Q4814103) (← links)
- Recurrence with affine level mappings is P-time decidable for CLP (Q5437651) (← links)
- Algorithmes hybrides génériques pour la résolution de problèmes de satisfaction de contraintes (Q5479853) (← links)