Dynamic programming algorithm with objective level cut for nonlinear knapsack problem
From MaRDI portal
Recommendations
- A dynamic programming algorithm for the bilevel Knapsack problem
- Dynamic programming algorithms for the bi-objective integer knapsack problem
- Development of a hybrid dynamic programming approach for solving discrete nonlinear Knapsack problems
- scientific article; zbMATH DE number 1423920
- A dynamic programming algorithm for the knapsack problem with setup
- Dynamic programming based algorithms for the discounted \(\{0-1\}\) knapsack problem
- An efficient algorithm for multi-dimensional nonlinear knapsack problems
- scientific article; zbMATH DE number 536590
- A reduction dynamic programming algorithm for the bi-objective integer knapsack problem
Cited in
(8)- Dynamic programming algorithms for the bi-objective integer knapsack problem
- Surrogate dual method for multi-dimensional nonlinear knapsack problems
- A hybrid method for solving 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
- Development of a hybrid dynamic programming approach for solving discrete nonlinear Knapsack problems
- An efficient algorithm for multi-dimensional nonlinear knapsack problems
- A new exact algorithm for concave knapsack problems with integer variables
This page was built for publication: Dynamic programming algorithm with objective level cut for nonlinear knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2823517)
