Lower Bounds on Time-Accuracy Trade-Offs for the 0-1 Knapsack Problem
From MaRDI portal
Publication:3796962
DOI10.1287/MOOR.13.3.497zbMath0651.90051OpenAlexW2040607183MaRDI QIDQ3796962
Publication date: 1988
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.13.3.497
lower boundsapproximation algorithmsguaranteed accuracyoraclesfeasibility tests0-1 knapsack optimizationdominance tests
Numerical mathematical programming methods (65K05) Integer programming (90C10) Boolean programming (90C09)
This page was built for publication: Lower Bounds on Time-Accuracy Trade-Offs for the 0-1 Knapsack Problem