Worst-case performance of the successive approximation algorithm for four identical knapsacks
From MaRDI portal
Publication:2450816
DOI10.3934/JIMO.2012.8.651zbMath1291.68443OpenAlexW2318328736MaRDI QIDQ2450816
Publication date: 16 May 2014
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2012.8.651
approximation algorithmknapsack problemworst-case analysismultiple knapsack problemsuccessive approximation algorithm
This page was built for publication: Worst-case performance of the successive approximation algorithm for four identical knapsacks