✦ LIBER ✦

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

✍ Scribed by A.H.G. Rinnooy Kan; L. Stougie; C. Vercellis

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 725 KB
Volume: 42
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(93)90051-o

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A complementary greedy heuristic for the

A complementary greedy heuristic for the knapsack problem

✍ D.J. White 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 411 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

A total-value greedy heuristic for the i

A total-value greedy heuristic for the integer knapsack problem

✍ Rajeev Kohli; Ramesh Krishnamurti 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 412 KB

Joint performance of greedy heuristics f

Joint performance of greedy heuristics for the integer knapsack problem

✍ Rajeev Kohli; Ramesh Krishnamurti 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 711 KB

A branch and search algorithm for a clas

A branch and search algorithm for a class of nonlinear knapsack problems

✍ Kamlesh Mathur; Harvey M. Salkin; Susumu Morito 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 455 KB

Worst-case analysis of greedy algorithms

Worst-case analysis of greedy algorithms for the unbounded knapsack, subset-sum and partition problems

✍ Tsung-Chyan Lai 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 360 KB