Tight complexity bounds for the two-dimensional real knapsack problem

DOI10.1007/s100920050026zbMath0947.65065OpenAlexW2018488770MaRDI QIDQ1300669

Valentin E. Brimkov, Mauro Leoncini, Stefan S. Dantchev

Publication date: 22 October 2000

Published in: Calcolo (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s100920050026

zbMATH Keywords

complexity boundstwo-dimensional knapsack problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Linear programming (90C05) Complexity and performance of numerical algorithms (65Y20)

Related Items (1)

An alternative to Ben-Or's lower bound for the knapsack problem complexity

This page was built for publication: Tight complexity bounds for the two-dimensional real knapsack problem