방법 비교

	동적 계획법	Tabu Search
분야	최적화	최적화
계열	Process / pipeline	Process / pipeline
기원 연도	1957	1989
창시자	Richard Bellman	Fred Glover
유형	Exact combinatorial optimization via recursive decomposition	Local-search metaheuristic
원전	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.
별칭	DP, Bellman's Principle of Optimality, Recursive Optimization, Dinamik Programlama	Tabu Araması (Tabu Search), TS, tabu metaheuristic
관련	3	4
요약	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.