✦ LIBER ✦

An extension of a greedy heuristic for the knapsack problem

✍ Scribed by D.J. White

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A complementary greedy heuristic for the

✍ D.J. White 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 411 KB

A total-value greedy heuristic for the i

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

Joint performance of greedy heuristics f

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

A Greedy Heuristic for the Set-Covering

✍ Chvatal, V. 📂 Article 📅 1979 🏛 INFORMS 🌐 English ⚖ 116 KB

A Greedy Heuristic for the Set-Covering

✍ V. Chvatal 📂 Article 📅 1979 🏛 INFORMS 🌐 English ⚖ 156 KB

Greedy algorithms for the minimization k

✍ G. N. Diubin; A. A. Korbut 📂 Article 📅 2008 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 258 KB