✦ LIBER ✦

On the dynamic programming approach to the “caterer” problem

✍ Scribed by Salah E Elmaghraby

Book ID: 107798736
Publisher: Elsevier Science
Year: 1964
Tongue: English
Weight: 656 KB
Volume: 8
Category: Article
ISSN: 0022-247X
DOI: 10.1016/0022-247x(64)90062-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the solution of the caterer problem

✍ J. W. Gaddum; A. J. Hoffman; D. Sokolowsky 📂 Article 📅 1954 🏛 John Wiley and Sons 🌐 English ⚖ 343 KB

A dynamic programming approach to the co

A dynamic programming approach to the complete set partitioning problem

✍ D. Yun Yeh 📂 Article 📅 1986 🏛 Springer Netherlands 🌐 English ⚖ 324 KB

95/00699 Dynamic programming approach to

95/00699 Dynamic programming approach to the inverse Stefan design problem

📂 Article 📅 1995 🏛 Elsevier Science ⚖ 205 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

The problem of absolute stability: a dyn

The problem of absolute stability: a dynamic programming approach

✍ Michael Margaliot; Rabin Gitizadeh 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 267 KB

One approach to solving problems of dyna

One approach to solving problems of dynamic convex programming

✍ Yu. P. Ivanilov; Yu. E. Malashenko 📂 Article 📅 1974 🏛 Springer US 🌐 English ⚖ 672 KB