✦ LIBER ✦

On non-serial dynamic programming

✍ Scribed by Umberto Bertelè; Francesco Brioschi

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

PARETO OPTIMAL SERIAL DYNAMIC PROGRAMMIN

✍ ROSENMAN, M. A.; GERO, J. S. 📂 Article 📅 1983 🏛 Taylor and Francis Group 🌐 English ⚖ 154 KB

Non-concave dynamic programming

✍ Kevin D. Cotter; Jee-Hyeong Park 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 99 KB

Dynamic programming for the analysis of

✍ Large, Edwaed W. 📂 Article 📅 1993 🏛 Psychonomic Society Publications 🌐 English ⚖ 583 KB

Optimal resource leveling using non-seri

✍ M. Bandelloni; M. Tucci; R. Rinaldi 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 859 KB

A new algorithm for the solution of the

✍ Umberto Bertelè; Francesco Brioschi 📂 Article 📅 1969 🏛 Elsevier Science 🌐 English ⚖ 450 KB

Determination of the best main serial ch

✍ Chae Y. Lee; Augustine O. Esogbue 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 682 KB