Pages that link to "Item:Q3870680"
From MaRDI portal
The following pages link to The use of dynamic programming methodology for the solution of a class of nonlinear programming problems (Q3870680):
Displaying 8 items.
- An approach for solving nonlinear multi-objective separable discrete optimization problem with one constraint (Q706934) (← links)
- Convergent Lagrangian and domain cut method for nonlinear knapsack problems (Q1001200) (← links)
- Parametric nonlinear integer programming: The right-hand side case (Q1179002) (← links)
- A branch and bound algorithm for solving separable convex integer programming problems (Q1342308) (← links)
- (Q5021865) (← links)
- An efficient algorithm for multi-dimensional nonlinear knapsack problems (Q5423360) (← links)
- Surrogate dual method for multi-dimensional nonlinear knapsack problems (Q5456301) (← links)
- An efficient algorithm for nonlinear integer programming problems arising in series–parallel reliability systems (Q5481688) (← links)