Tight complexity bounds for the two-dimensional real knapsack problem
It is proved that the complexity of the two-dimensional knapsack problem with real coefficients is given by \(\Theta(\log(b/\min(a_1,a_2))\), where \(a_1, a_2\) are the coefficients of the contraint inequality.
scientific article; zbMATH DE number 1330875