Approximate method of solution of one-dimensional knapsack problem

MaRDI QIDQ1132738zbMATH OpenFDO

Authors M. A. Zuenkov, V. V. Ignatushchenko

Publication date 1979

Published in Automation and Remote Control (Search for Journal in Brave)

zbMATH Keywords

approximate algorithmBoolean programmingbranch-and-boundcomputational complexitydynamic programmingexact combinatorial methodsheuristicneighborhood search procedureone-dimensional knapsack problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Boolean programming (90C09)

This page was built for publication: Approximate method of solution of one-dimensional knapsack problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1132738)