Surrogate dual method for multi-dimensional nonlinear knapsack problems

DOI10.1007/S11741-007-0404-1MaRDI QIDQ5456301zbMATH OpenOpenAlexFDO

Authors Shanshan Kong, Xiaoling Sun

Publication date 4 April 2008

Published in Journal of Shanghai University (English Edition) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11741-007-0404-1

zbMATH Keywords

Lagrangian dualnonlinear knapsack problemsurrogate dual algorithm

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Integer programming (90C10) Duality theory (optimization) (49N15)

Recommendations

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

Cites work

• scientific article; zbMATH DE number 4072712 (Why is no real title available?)
• A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
• A Survey of Methods for Pure Nonlinear Integer Programming
• A hybrid approach to discrete mathematical programming
• A hybrid method for solving nonlinear knapsack problems
• A nonlinear knapsack problem
• A surrogate relaxation based algorithm for a general quadratic multi- dimensional knapsack problem
• Calculating surrogate constraints
• Exact algorithm for concave knapsack problems: linear underestimation and partition method
• Exact algorithm for the surrogate dual of an integer programming problem: Subgradient method approach
• Nonlinear integer programming
• Technical Note—Searchability of the Composite and Multiple Surrogate Dual Functions
• The Nonlinear Resource Allocation Problem
• The nonlinear knapsack problem - algorithms and applications
• The use of dynamic programming methodology for the solution of a class of nonlinear programming problems

Cited in

(5)

• Revisiting surrogate relaxation for the multidimensional knapsack problem
• An efficient algorithm for multi-dimensional nonlinear knapsack problems
• A Lagrangian dual and surrogate method for multi-dimensional quadratic knapsack problems
• Computational study of surrogate dual method for multi-dimensional nonlinear Knapsack problems
• Cutting and surrogate constraint analysis for improved multidimensional knapsack solutions

This page was built for publication: 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 Q5456301)