A fine-grained arc-consistency algorithm for non-normalized constraint satisfaction problems
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1234562 (Why is no real title available?)
- scientific article; zbMATH DE number 2053093 (Why is no real title available?)
- scientific article; zbMATH DE number 1835980 (Why is no real title available?)
- A generic arc-consistency algorithm and its specializations
- An optimal coarse-grained arc consistency algorithm
- Arc consistency for factorable relations.
- Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
- Consistency in networks of relations
- Evolutionary algorithms for jobshop scheduling
- Handbook of constraint programming.
- Input Constraints Handling in an MPC/Feedback Linearization Scheme
- Self-tuning generalized predictive control with input constraints
- Using constraint metaknowledge to reduce arc consistency computation
Cited in
(5)- scientific article; zbMATH DE number 6825406 (Why is no real title available?)
- The Power of Arc Consistency for CSPs Defined by Partially-Ordered Forbidden Patterns
- Selection of search strategies for solving 3-SAT problems
- scientific article; zbMATH DE number 2080326 (Why is no real title available?)
- Actuator fault diagnosis for flat systems: a constraint satisfaction approach
This page was built for publication: A fine-grained arc-consistency algorithm for non-normalized constraint satisfaction problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5403428)