Approximated consistency for the automatic recording constraint
From MaRDI portal
(Redirected from Publication:1010285)
Recommendations
Cites work
- A Sufficient Condition for Backtrack-Free Search
- Approximated consistency for knapsack constraints
- Approximated consistency for the automatic recording constraint
- Consistency in networks of relations
- Constraint programming based Lagrangian relaxation for the automatic recording problem
- Cost based filtering for the constrained knapsack problem
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- scientific article; zbMATH DE number 3644821 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1487984 (Why is no real title available?)
- scientific article; zbMATH DE number 1875413 (Why is no real title available?)
- Principles and Practice of Constraint Programming – CP 2004
- Solving fixed-charge network flow problems with a hybrid optimization and constraint programming approach
Cited in
(4)
This page was built for publication: Approximated consistency for the automatic recording constraint
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1010285)