Comments on Mohr and Henderson's path consistency algorithm
From MaRDI portal
(Redirected from Comments on Mohr and Henderson's path consistency algorithm)
Cites work
Cited in
(15)- An optimal k-consistency algorithm
- The job shop scheduling problem: Conventional and new solution techniques
- Characterising tractable constraints
- Model-based inference in CHARME.
- Fundamental properties of neighbourhood substitution in constraint satisfaction problems
- Constraint propagation techniques for the disjunctive scheduling problem
- A multiagent evolutionary algorithm with direct and indirect combined representation for constraint satisfaction problems
- On-line algorithms for networks of temporal constraints
- Reduction operations in fuzzy or valued constraint satisfaction
- On the arc consistency problem
- Path Consistency by Dual Consistency
- Parameterized complexity of the workflow satisfiability problem
- Multi-agent oriented constraint satisfaction
- Cyclic consistency: A local reduction operation for binary valued constraints
- Generalising submodularity and Horn clauses: Tractable optimization problems defined by tournament pair multimorphisms
This page was built for publication: Comments on Mohr and Henderson's path consistency algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q921947)