Pages that link to "Item:Q2823517"
From MaRDI portal
The following pages link to Dynamic programming algorithm with objective level cut for nonlinear knapsack problem (Q2823517):
Displaying 6 items.
- Dynamic programming algorithms for the bi-objective integer knapsack problem (Q299843) (← links)
- An efficient algorithm for the Lagrangean dual of nonlinear knapsack problems with additional nested constraints (Q675985) (← links)
- Convergent Lagrangian and domain cut method for nonlinear knapsack problems (Q1001200) (← links)
- A hybrid method for solving nonlinear knapsack problems (Q1123129) (← links)
- Development of a hybrid dynamic programming approach for solving discrete nonlinear Knapsack problems (Q2371518) (← links)
- Surrogate dual method for multi-dimensional nonlinear knapsack problems (Q5456301) (← links)