✦ LIBER ✦

A linear-time algorithm for solving continuous maximin knapsack problems

✍ Scribed by Takahito Kuno; Hiroshi Konno; Eitan Zemel

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Linear Time Algorithms for Knapsack Prob

✍ David Pisinger 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 140 KB

A fast algorithm for the linear multiple

✍ Krzysztof Dudziński; Stanisław Walukiewicz 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 256 KB

A branch and bound algorithm for solving

✍ M.E. Dyer; N. Kayal; J. Walker 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 865 KB

A mofified gub algorithm for solving lin

✍ Takahito Kuno; Kouji Mori; Hiroshi Konno 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 426 KB 👁 2 views

A linear time algorithm for graph partit

✍ L.H. Clark; F. Shahrokhi; L.A. Székely 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 483 KB

A linear-time algorithm for solving the

✍ Godfried T. Toussaint 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 201 KB