R. Bellman, Dynamic Programming, 1957.

R. Carraway and R. Schmidt, Note???An Improved Discrete Dynamic Programming Algorithm for Allocating Resources Among Interdependent Projects, Management Science, vol.37, issue.9, pp.1195-1200, 1991.
DOI : 10.1287/mnsc.37.9.1195

G. Dantzig, Discrete-Variable Extremum Problems, Operations Research, vol.5, issue.2, pp.266-277, 1957.
DOI : 10.1287/opre.5.2.266

J. Eisner, E. Goldlust, and N. A. Smith, Compiling Comp Ling, Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing , HLT '05, pp.281-290, 2005.
DOI : 10.3115/1220575.1220611

M. Garcia-de, L. Banda, and P. J. Stuckey, Dynamic programming to minimize the maximum number of open stacks See (Constraint Modelling Challenge) for a shorter version, INFORMS Journal of Computing, vol.19, issue.4, pp.607-617, 2007.

R. Giegerich and C. Meyer, Algebraic Dynamic Programming, AMAST '02: Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology, pp.349-364, 2002.
DOI : 10.1007/3-540-45719-4_24
URL : https://hal.archives-ouvertes.fr/hal-00857801

H. Hohwald, I. Thayer, and R. E. Korf, Comparing best-first search and dynamic programming for optimal multiple sequence alignment, IJCAI-03, Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, pp.1239-1245, 2003.

H. Kellerer, U. Pferschy, and D. Pisinger, Knapsack Problems, 2004.
DOI : 10.1007/978-3-540-24777-7

Y. A. Liu and S. D. Stoller, Dynamic programming via static incrementalization, Higher Order and Symbolic Computation, pp.37-62, 2003.

S. Martello, D. Pisinger, and P. Toth, Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem, Management Science, vol.45, issue.3, pp.414-424, 1999.
DOI : 10.1287/mnsc.45.3.414

D. Michie, ???Memo??? Functions and Machine Learning, Nature, vol.218, issue.5138, pp.19-22, 1968.
DOI : 10.1038/218306c0

T. L. Morin and R. E. Martsen, Branch-and-Bound Strategies for Dynamic Programming, Operations Research, vol.24, issue.4, pp.611-627, 1976.
DOI : 10.1287/opre.24.4.611

Z. Somogyi and K. F. Sagonas, Tabling in Mercury: Design and Implementation, Practical Aspects of Declarative Languages, 8th International Symposium, PADL 2006, pp.150-167, 2006.
DOI : 10.1007/11603023_11

J. L. Spouge, Speeding up Dynamic Programming Algorithms for Finding Optimal Lattice Paths, SIAM Journal on Applied Mathematics, vol.49, issue.5, pp.1552-1566, 1989.
DOI : 10.1137/0149094

H. M. Weingartner and D. N. Ness, Methods for the Solution of the Multidimensional 0/1 Knapsack Problem, Operations Research, vol.15, issue.1, pp.83-103, 1967.
DOI : 10.1287/opre.15.1.83

M. Yavuz and S. Tufekci, A bounded dynamic programming solution to the batching problem in mixed-model just-in-time manufacturing systems, International Journal of Production Economics, vol.103, issue.2, 2006.
DOI : 10.1016/j.ijpe.2006.01.006