Approximate method of solution of one-dimensional knapsack problem
From MaRDI portal
Publication:1132738
zbMath0419.90070MaRDI QIDQ1132738
V. V. Ignatushchenko, M. A. Zuenkov
Publication date: 1979
Published in: Automation and Remote Control (Search for Journal in Brave)
computational complexitydynamic programmingbranch-and-boundheuristicBoolean programmingapproximate algorithmone-dimensional knapsack problemexact combinatorial methodsneighborhood search procedure
This page was built for publication: Approximate method of solution of one-dimensional knapsack problem