scientific article
From MaRDI portal
Publication:3321838
zbMath0536.90062MaRDI QIDQ3321838
U. G. Nuriev, Alexandr Nikitin
Publication date: 1983
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computational complexitycombination of heuristic and dynamic programming methodsone-dimensional knapsack problem with Boolean variablespseudonominal time
Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Integer programming (90C10) Dynamic programming (90C39) Boolean programming (90C09)
Related Items (2)
Exact methods for the knapsack problem and its generalizations ⋮ Pseudopolynomial algorithms for the solution of backpack problems
This page was built for publication: