An efficient algorithm for multi-dimensional nonlinear knapsack problems
From MaRDI portal
Publication:5423360
DOI10.1007/s11741-006-0079-5zbMath1156.90430MaRDI QIDQ5423360
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
Lagrangian relaxation; nonlinear integer programming; subgradient method; cutting plane; nonlinear knapsack problem
Cites Work
- Unnamed Item
- Convergent Lagrangian and domain cut method for nonlinear knapsack problems
- A hybrid method for solving nonlinear knapsack problems
- The nonlinear knapsack problem - algorithms and applications
- Branch and Bound Experiments in Convex Nonlinear Integer Programming
- The use of dynamic programming methodology for the solution of a class of nonlinear programming problems
- A Survey of Methods for Pure Nonlinear Integer Programming
- Solving the subproblem in the lagrangian dual of separable discrete programs with linear constraints
- A hybrid approach to discrete mathematical programming