List of algorithms: Difference between revisions

Revision as of 00:16, 5 June 2025

Revision as of 00:27, 5 June 2025

Line 495:

** [[Hungarian method]]: a combinatorial optimization algorithm which solves the [[assignment problem]] in polynomial time

* [[Constraint satisfaction]]{{anchor|Constraint satisfaction}}

** General[[AC-3 algorithm]] general algorithms for the constraint satisfaction

*** [[AC-3 algorithm]]

*** [[Difference map algorithm]]

*** [[Min conflicts algorithm]]

** [[Chaff algorithm]]: an algorithm for solving instances of the [[Boolean satisfiability problem]]

** [[Davis–Putnam algorithm]]: check the validity of a first-order logic formula

** [[Difference map algorithm]] general algorithms for the constraint satisfaction

** [[DPLL algorithm|Davis–Putnam–Logemann–Loveland algorithm]] (DPLL): an algorithm for deciding the satisfiability of propositional logic formula in [[conjunctive normal form]], i.e. for solving the [[CNF-SAT]] problem

** [[Exact cover]] problem

** [[Min conflicts algorithm]] general algorithms for the constraint satisfaction

*** [[Algorithm X]]: a [[nondeterministic algorithm]]

*** [[Dancing Links]]: an efficient implementation of Algorithm X