Worst-case and average-case analysis of an algorithm solving a generalized knapsack problem
From MaRDI portal
Publication:3330975
DOI10.1080/02331938308842893zbMath0542.90069OpenAlexW2084038215MaRDI QIDQ3330975
Publication date: 1983
Published in: Mathematische Operationsforschung und Statistik. Series Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331938308842893
nonconvex optimizationpolynomial algorithmsaverage-case behaviourdiscontinuous linear knapsack problem
This page was built for publication: Worst-case and average-case analysis of an algorithm solving a generalized knapsack problem