The following pages link to OscaR (Q21887):
Displaying 16 items.
- A parametric propagator for pairs of \textsc{Sum} constraints with a discrete convexity property (Q334808) (← links)
- A constraint-based local search backend for MiniZinc (Q890003) (← links)
- Improved filtering for the bin-packing with cardinality constraint (Q1617384) (← links)
- Efficient filtering for the resource-cost alldifferent constraint (Q1701236) (← links)
- Mining time-constrained sequential patterns with constraint programming (Q1701240) (← links)
- How efficient is a global constraint in practice? A fair experimental framework (Q1706598) (← links)
- The item dependent stockingcost constraint (Q2009188) (← links)
- The weighted arborescence constraint (Q2011589) (← links)
- SeaPearl: a constraint programming solver guided by reinforcement learning (Q2117242) (← links)
- An efficient filtering algorithm for the unary resource constraint with transition times and optional activities (Q2197325) (← links)
- MiniCP: a lightweight solver for constraint programming (Q2246188) (← links)
- Generating compound moves in local search by hybridisation with complete search (Q2327242) (← links)
- Bound-consistent spread constraint. Application to load balancing in nurse-to-patient assignments (Q2513745) (← links)
- Achieving Domain Consistency and Counting Solutions for Dispersion Constraints (Q2802248) (← links)
- (Q5020594) (← links)
- Generic Constraint-based Block Modeling using Constraint Programming (Q5856475) (← links)
