Computational study of surrogate dual method for multi-dimensional nonlinear Knapsack problems

MaRDI QIDQ5453754zbMATHFDO

Authors Xiaoling Sun, Shanshan Kong, Duan Li

Publication date 3 April 2008

zbMATH Keywords

branch-and-bound methodLagrangian dual

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Integer programming (90C10)

Recommendations

• Surrogate dual method for multi-dimensional nonlinear knapsack problems
• An efficient algorithm for multi-dimensional nonlinear knapsack problems
• The multidimensional 0-1 knapsack problem -- bounds and computational aspects
• Dynamic programming algorithm with objective level cut for nonlinear knapsack problem
• A Lagrangian dual and surrogate method for multi-dimensional quadratic knapsack problems

Cited in

(3)

• An efficient algorithm for multi-dimensional nonlinear knapsack problems
• A Lagrangian dual and surrogate method for multi-dimensional quadratic knapsack problems
• Surrogate dual method for multi-dimensional nonlinear knapsack problems

This page was built for publication: Computational study of surrogate dual method for multi-dimensional nonlinear Knapsack problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5453754)