Publication:3804448
From MaRDI portal
DOI<431::AID-NAV3220340309>3.0.CO;2-P 10.1002/1520-6750(198706)34:3<431::AID-NAV3220340309>3.0.CO;2-PzbMath0656.90068MaRDI QIDQ3804448
Ronald L. Rardin, Mark H. Karwan, Sanjiv Sarin
Publication date: 1987
branch-and-bound; Lagrangian duality; Computational experience; capital budgeting; surrogate dual multipliers; Efficient computation of tight bounds; Lagrangian search methods; surrogate duals
Related Items
Surrogate dual method for multi-dimensional nonlinear knapsack problems, A modified subgradient algorithm for Lagrangean relaxation, The multidimensional 0-1 knapsack problem -- bounds and computational aspects, A computational evaluation of two subgradient search methods, Surrogate duality in a branch-and-bound procedure for integer programming, A surrogate heuristic for set covering problems, Exact algorithm for the surrogate dual of an integer programming problem: Subgradient method approach, The multidimensional 0-1 knapsack problem: an overview.