scientific article

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

Mark H. Karwan, Ronald L. Rardin, Sanjiv Sarin

Publication date: 1987

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

branch-and-boundLagrangian dualityComputational experiencecapital budgetingsurrogate dual multipliersEfficient computation of tight boundsLagrangian search methodssurrogate duals

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10)

Related Items

On Generalized Surrogate Duality in Mixed-Integer Nonlinear Programming, A computational evaluation of two subgradient search methods, A surrogate heuristic for set covering problems, Surrogate duality in a branch-and-bound procedure for integer programming, Exact algorithm for the surrogate dual of an integer programming problem: Subgradient method approach, The multidimensional 0-1 knapsack problem: an overview., A modified subgradient algorithm for Lagrangean relaxation, Surrogate dual method for multi-dimensional nonlinear knapsack problems, On the complexity of surrogate and group relaxation for integer linear programs, Revisiting surrogate relaxation for the multidimensional knapsack problem, On generalized surrogate duality in mixed-integer nonlinear programming, The multidimensional 0-1 knapsack problem -- bounds and computational aspects