✦ LIBER ✦

When the Greedy Solution Solves a Class of Knapsack Problems

✍ Scribed by M. J. Magazine, G. L. Nemhauser and L. E. Trotter Jr.

Book ID: 123686255
Publisher: INFORMS
Year: 1975
Tongue: English
Weight: 989 KB
Volume: 23
Category: Article
ISSN: 0030-364X
DOI: 10.2307/169525

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Long Division: An Example of When the Gr

Long Division: An Example of When the Greedy Algorithm Solves a Knapsack Problem

✍ Magazine, Michael J.; Nuttle, Henry L. W. 📂 Article 📅 1976 🏛 Taylor and Francis Group 🌐 English ⚖ 168 KB

Smart greedy procedure for solving a nOn

Smart greedy procedure for solving a nOnlinear knapsack class of reliability optimization problems

✍ H. Ohtagaki; Y. Nakagawa; A. Iwasaki; H. Narihisa 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 772 KB

new heuristic procedure, which is called Smart Greedy, is proposed for solving a kind of general reliability optimization problems (non-DGR type knapsack problems). Smart Greedy uses Recursive Greedy with multiple greedy functions designated by balance coefficients, generates several solutions, and

Smart greedy procedure for solving a mul

Smart greedy procedure for solving a multidimensional nonlinear knapsack class of reliability optimization problems

✍ H Ohtagaki; A Iwasaki; Y Nakagawa; H Narihisa 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 493 KB

A class of generalized greedy algorithms

A class of generalized greedy algorithms for the multi-knapsack problem

✍ A.H.G. Rinnooy Kan; L. Stougie; C. Vercellis 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 725 KB

Exact solution of a class of nonlinear k

Exact solution of a class of nonlinear knapsack problems

✍ Samir Elhedhli 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 191 KB

A method of solving the knapsack problem

✍ G.P. Veliev; K.Sh. Mamedov 📂 Article 📅 1981 🏛 Elsevier Science ⚖ 432 KB