Dynamic programming (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Dynamic programming" in English language version.

refsWebsite

Global rank English rank

2^nd place

2^nd place

3books.google.com

3^rd place

3^rd place

4^th place

4^th place

2web.archive.org

1^st place

1^st place

low place

low place

2,656^th place

5,310^th place

1unimelb.edu.au

3,221^st place

2,222^nd place

1semanticscholar.org

11^th place

8^th place

1oregonstate.edu

2,041^st place

1,331^st place

6^th place

6^th place

low place

low place

a2c2.org

Kushner, Harold J. (2004-07-01). "Richard E. Bellman Control Heritage Award". Archived from the original on 2014-10-19.

archive.org

Nocedal, J.; Wright, S. J. (2006). Numerical Optimization. Springer. p. 9. ISBN 9780387303031.

books.google.com

Kamien, M. I.; Schwartz, N. L. (1991). Dynamic Optimization: The Calculus of Variations and Optimal Control in Economics and Management (Second ed.). New York: Elsevier. p. 261. ISBN 978-0-444-01609-6.
Kirk, Donald E. (1970). Optimal Control Theory: An Introduction. Englewood Cliffs, NJ: Prentice-Hall. pp. 94–95. ISBN 978-0-13-638098-6.
Konhauser J.D.E., Velleman, D., and Wagon, S. (1996). Which way did the Bicycle Go? Dolciani Mathematical Expositions – No 18. The Mathematical Association of America.

doi.org

Delisi, Charles (July 1974), "Cooperative phenomena in homopolymers: An alternative formulation of the partition function", Biopolymers, 13 (7): 1511–1512, doi:10.1002/bip.1974.360130719
Dijkstra, E. W. (December 1959). "A note on two problems in connexion with graphs". Numerische Mathematik. 1 (1): 269–271. doi:10.1007/BF01386390.
Eddy, S. R. (2004). "What is Dynamic Programming?". Nature Biotechnology. 22 (7): 909–910. doi:10.1038/nbt0704-909. PMID 15229554. S2CID 5352062.
Moshe Sniedovich (2002), "OR/MS Games: 2. The Towers of Hanoi Problem", INFORMS Transactions on Education, 3 (1): 34–51, doi:10.1287/ited.3.1.45.
Sniedovich, Moshe (2003). "OR/MS Games: 4. The Joy of Egg-Dropping in Braunschweig and Hong Kong". INFORMS Transactions on Education. 4: 48–64. doi:10.1287/ited.4.1.48.

icm.edu.pl

matwbn.icm.edu.pl

Sniedovich, M. (2006), "Dijkstra's algorithm revisited: the dynamic programming connexion" (PDF), Journal of Control and Cybernetics, 35 (3): 599–620. Online version of the paper with interactive computational modules.

jsoftware.com

"M. Memo". J Vocabulary. J Software. Retrieved 28 October 2011.

nih.gov

pubmed.ncbi.nlm.nih.gov

Gurskiĭ, G. V.; Zasedatelev, A. S. (September 1978), "Precise relationships for calculating the binding of regulatory proteins and other lattice ligands in double-stranded polynucleotides", Biofizika, 23 (5): 932–946, PMID 698271
Eddy, S. R. (2004). "What is Dynamic Programming?". Nature Biotechnology. 22 (7): 909–910. doi:10.1038/nbt0704-909. PMID 15229554. S2CID 5352062.

oregonstate.edu

ir.library.oregonstate.edu

Dean Connable Wills, Connections between combinatorics of permutations and algorithms and geometry

semanticscholar.org

api.semanticscholar.org

Eddy, S. R. (2004). "What is Dynamic Programming?". Nature Biotechnology. 22 (7): 909–910. doi:10.1038/nbt0704-909. PMID 15229554. S2CID 5352062.

unimelb.edu.au

ifors.ms.unimelb.edu.au

Sniedovich, M. (2006), "Dijkstra's algorithm revisited: the dynamic programming connexion" (PDF), Journal of Control and Cybernetics, 35 (3): 599–620. Online version of the paper with interactive computational modules.

web.archive.org

Stuart Dreyfus. "Richard Bellman on the birth of Dynamical Programming".
Kushner, Harold J. (2004-07-01). "Richard E. Bellman Control Heritage Award". Archived from the original on 2014-10-19.