विधियों की तुलना करें

	कन्स्ट्रेंट प्रोग्रामिंग	Dynamic Programming	Tabu Search
क्षेत्र	अनुकूलन	अनुकूलन	अनुकूलन
परिवार	Process / pipeline	Process / pipeline	Process / pipeline
उद्भव वर्ष	2006	1957	1989
प्रवर्तक	Rossi, van Beek & Walsh	Richard Bellman	Fred Glover
प्रकार	Declarative combinatorial optimization	Exact combinatorial optimization via recursive decomposition	Local-search metaheuristic
मौलिक स्रोत	Rossi, F., van Beek, P., & Walsh, T. (Eds.). (2006). Handbook of Constraint Programming. Elsevier. ISBN: 978-0-444-52726-4	Bellman, R. (1957). Dynamic Programming. Princeton University Press. ISBN: 978-0-691-07951-6	Glover, F. (1989). Tabu Search — Part I. ORSA Journal on Computing, 1(3), 190–206.
उपनाम	Constraint Satisfaction Programming, Constraint-Based Optimization, Kısıt Programlama, CSP Optimization	DP, Bellman's Principle of Optimality, Recursive Optimization, Dinamik Programlama	Tabu Araması (Tabu Search), TS, tabu metaheuristic
संबंधित	3	3	4
सारांश	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.	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.	Tabu Search is a local-search metaheuristic introduced by Fred Glover in 1989 that uses a tabu list — a short-term memory of recently visited solutions — to prevent cycling and escape local optima. By explicitly forbidding moves that reverse recent decisions, the algorithm explores the search space more broadly and, through long-term memory structures such as aspiration criteria, aims to approach the global optimum even in large, complex combinatorial problems.