An efficient algorithm for the Lagrangean dual of nonlinear knapsack problems with additional nested constraints

Armstrong, 1982, The nested multiple-choice knapsack model, Management Sci., 28, 34, 10.1287/mnsc.28.1.34 Dyer, 1995, A hybrid dynamic programming/branch and bound algorithm for the multiple choice knapsack problem, J. Comput. Appl. Math., 58, 43, 10.1016/0377-0427(93)E0264-M Dyer, 1985, A simple graphical method for a production/purchasing problem, 26 Dyer, 1987, An algorithm for a separable integer programming problem with cumulatively bounded variables, Discrete Appl. Math., 16, 135, 10.1016/0166-218X(87)90070-9 Dyer, 1980, Calculating surrogate constraints, Math. Programming, 19, 255, 10.1007/BF01581647 Frederickson, 1982, The complexity of selection and ranking in X + Y and matrices with sorted columns, J. Comput. System Sci., 24, 197, 10.1016/0022-0000(82)90048-4 Fisher, 1981, The Lagrangian relaxation method for solving integer programming problems, Management Sci., 27, 1, 10.1287/mnsc.27.1.1 Greenberg, 1977, The one-dimensional generalised Lagrange multiplier problem, Oper. Res., 25, 338, 10.1287/opre.25.2.338 Mavrides, 1979, Nonlinear programming with cumulatively bounded variables, J. Comput. Appl. Math., 5, 163, 10.1016/0377-0427(79)90001-3 Tamir, 1980, Efficient algorithms for a selection problem with nested constraints and its application to a production-sales planning problem, SIAM J. Control Optim., 18, 282, 10.1137/0318019 Tamir, 1979 Walker, 1978, An interactive method as an aid in solving bicriterion mathematical programming problems, J. Oper. Res. Soc., 29, 915, 10.1057/jors.1978.195