✦ LIBER ✦

A method of solving the knapsack problem

✍ Scribed by G.P. Veliev; K.Sh. Mamedov

Publisher: Elsevier Science
Year: 1981
Weight: 432 KB
Volume: 21
Category: Article
ISSN: 0041-5553
DOI: 10.1016/0041-5553(81)90066-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Solving the generalized knapsack problem

Solving the generalized knapsack problem with variable coefficients

✍ Kaj Holmberg; Kurt Jörnsten 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 1012 KB

In this article we present methods based on Lagrangian duality and decomposition techniques for the generalized knapsack problem with variable coefficients. The Lagrangian dual is solved with subgradient optimization or interval bisection. We also describe a heuristic that yields primal feasible sol

Average Saving Effects in Enumerative Me

Average Saving Effects in Enumerative Methods for Solving Knapsack Problems

✍ Karl Heinz Borgwardt; Jürgen Brzank 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 404 KB

The use of duality to increase the effec

The use of duality to increase the effectiveness of the branch and bound method when solving the knapsack problem

✍ A.O. Alekseyev; O.G. Alekseyev; V.G. Anisimov; E.G. Anisimov 📂 Article 📅 1985 🏛 Elsevier Science ⚖ 334 KB

A numerical method of solving the stokes

A numerical method of solving the stokes problem

✍ G.M. Kobel'kov 📂 Article 📅 1975 🏛 Elsevier Science ⚖ 324 KB

A method of solving the partial eigenval

A method of solving the partial eigenvalue problem

✍ A.A. Levin 📂 Article 📅 1965 🏛 Elsevier Science ⚖ 366 KB

A method of solving the time-optimal pro

A method of solving the time-optimal problem

✍ P.A. Nepomyashchii 📂 Article 📅 1971 🏛 Elsevier Science ⚖ 1021 KB