✦ LIBER ✦

Dynamic programming and the secretary problem

✍ Scribed by M.J. Beckmann

Book ID: 108020402
Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 162 KB
Volume: 19
Category: Article
ISSN: 0898-1221
DOI: 10.1016/0898-1221(90)90145-a

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Dynamic programming and the backpacker's

Dynamic programming and the backpacker's linear search problem

✍ Alan Washburn 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 545 KB

Dynamic Programming in the Problem of De

Dynamic Programming in the Problem of Decomposition Optimization

✍ A. G. Chentsov; P. A. Chentsov 📂 Article 📅 2002 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 165 KB

The cauchy problem for Bellman's dynamic

The cauchy problem for Bellman's dynamic programming equation

✍ R.P. Fedorenko 📂 Article 📅 1969 🏛 Elsevier Science ⚖ 587 KB

On the dynamic programming approach to t

On the dynamic programming approach to the “caterer” problem

✍ Salah E Elmaghraby 📂 Article 📅 1964 🏛 Elsevier Science 🌐 English ⚖ 656 KB

Dynamic programming approaches to the mu

Dynamic programming approaches to the multiple criteria knapsack problem

✍ Kathrin Klamroth; Margaret M. Wiecek 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 251 KB 👁 2 views

We study the integer multiple criteria knapsack problem and propose dynamicprogramming-based approaches to finding all the nondominated solutions. Different and more complex models are discussed, including the binary multiple criteria knapsack problem, problems with more than one constraint, and mul

Application of dynamic programming to th

Application of dynamic programming to the general inverse problem

✍ D. M. Trujillo 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 382 KB