Pages that link to "Item:Q1123129"
From MaRDI portal
The following pages link to A hybrid method for solving nonlinear knapsack problems (Q1123129):
Displaying 12 items.
- A hybrid of nested partition, binary ant system, and linear programming for the multidimensional knapsack problem (Q732881) (← links)
- On duality for Boolean programming (Q750292) (← links)
- On a discrete nonlinear and nonseparable knapsack problem (Q920849) (← links)
- Convergent Lagrangian and domain cut method for nonlinear knapsack problems (Q1001200) (← links)
- A note on a general nonlinear knapsack problem (Q1081534) (← links)
- Development of a hybrid dynamic programming approach for solving discrete nonlinear Knapsack problems (Q2371518) (← links)
- Hybrid rounding techniques for knapsack problems (Q2489957) (← links)
- HEURISTIC AND EXACT SOLUTION METHOD FOR CONVEX NONLINEAR KNAPSACK PROBLEM (Q4649881) (← 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)