Compară metode

	Programare Dinamică	Programare cu constrângeri
Domeniu	Optimizare	Optimizare
Familie	Process / pipeline	Process / pipeline
Anul apariției	1957	2006
Autorul original	Richard Bellman	Rossi, van Beek & Walsh
Tip	Exact combinatorial optimization via recursive decomposition	Declarative combinatorial optimization
Sursa seminală	Bellman, R. (1957). Dynamic Programming. Princeton University Press. ISBN: 978-0-691-07951-6	Rossi, F., van Beek, P., & Walsh, T. (Eds.). (2006). Handbook of Constraint Programming. Elsevier. ISBN: 978-0-444-52726-4
Denumiri alternative	DP, Bellman's Principle of Optimality, Recursive Optimization, Dinamik Programlama	Constraint Satisfaction Programming, Constraint-Based Optimization, Kısıt Programlama, CSP Optimization
Înrudite	3	3
Rezumat	Dynamic Programming (DP) is an exact optimization technique introduced by Richard Bellman in 1957 for solving multi-stage decision problems. It decomposes a complex problem into simpler, overlapping subproblems, solves each subproblem once, and stores the results to avoid redundant computation. Grounded in the Principle of Optimality, DP guarantees globally optimal solutions whenever the problem exhibits overlapping subproblems and optimal substructure.	Constraint Programming (CP) is a declarative optimization paradigm in which a problem is formulated as a set of variables, finite domains, and constraints, and a solver systematically searches for assignments that satisfy all constraints. Formalized comprehensively by Rossi, van Beek, and Walsh in their 2006 Handbook of Constraint Programming, CP unifies propagation-based pruning with intelligent backtracking search to tackle combinatorial problems across scheduling, planning, and configuration domains.