An efficient algorithm for multi-dimensional nonlinear knapsack problems

DOI10.1007/S11741-006-0079-5MaRDI QIDQ5423360zbMATH OpenOpenAlexFDO

Authors Juan Chen, Xiaoling Sun, Huijuan Guo

Publication date 23 October 2007

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

Full work available at URL https://doi.org/10.1007/s11741-006-0079-5

zbMATH Keywords

subgradient methodLagrangian relaxationcutting planenonlinear integer programmingnonlinear knapsack problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Recommendations

• Surrogate dual method for multi-dimensional nonlinear knapsack problems
• Convergent Lagrangian and domain cut method for nonlinear knapsack problems
• Computational study of surrogate dual method for multi-dimensional nonlinear Knapsack problems
• Dynamic programming algorithm with objective level cut for nonlinear knapsack problem
• An efficient algorithm for the Lagrangean dual of nonlinear knapsack problems with additional nested constraints

Cites work

• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• A Survey of Methods for Pure Nonlinear Integer Programming
• A hybrid approach to discrete mathematical programming
• A hybrid method for solving nonlinear knapsack problems
• Branch and Bound Experiments in Convex Nonlinear Integer Programming
• Convergent Lagrangian and domain cut method for nonlinear knapsack problems
• Solving the subproblem in the lagrangian dual of separable discrete programs with linear constraints
• 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

(11)

• A fast algorithm for the linear multiple-choice knapsack problem
• Surrogate dual method for multi-dimensional nonlinear knapsack problems
• scientific article; zbMATH DE number 1617338 (Why is no real title available?)
• A new exact algorithm for general orthogonal d-dimensional knapsack problems
• Convergent Lagrangian and domain cut method for nonlinear knapsack problems
• Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls
• Computational study of surrogate dual method for multi-dimensional nonlinear Knapsack problems
• scientific article; zbMATH DE number 6129400 (Why is no real title available?)
• scientific article; zbMATH DE number 1264415 (Why is no real title available?)
• Dynamic programming algorithm with objective level cut for nonlinear knapsack problem
• A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem

This page was built for publication: An efficient algorithm 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 Q5423360)