Pages that link to "Item:Q4887719"
From MaRDI portal
The following pages link to A Projection Method for the Integer Quadratic Knapsack Problem (Q4887719):
Displaying 13 items.
- Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies (Q319183) (← links)
- A breakpoint search approach for convex resource allocation problems with bounded variables (Q691476) (← links)
- Variable fixing algorithms for the continuous quadratic Knapsack problem (Q927220) (← links)
- A unified method for a class of convex separable nonlinear knapsack problems (Q930930) (← links)
- The nonlinear knapsack problem - algorithms and applications (Q1600928) (← links)
- Variable fixing method by weighted average for the continuous quadratic knapsack problem (Q2074624) (← links)
- A survey on the continuous nonlinear resource allocation problem (Q2456404) (← links)
- Breakpoint searching algorithms for the continuous quadratic knapsack problem (Q2465658) (← links)
- A relaxed projection method for general integer quadratic knapsack problem. (Q2477123) (← links)
- New algorithm for quadratic integer knapsack problems (Q2994046) (← links)
- HEURISTIC AND EXACT SOLUTION METHOD FOR CONVEX NONLINEAR KNAPSACK PROBLEM (Q4649881) (← links)
- An Efficient Hybrid Algorithm for the Separable Convex Quadratic Knapsack Problem (Q5270754) (← links)
- A pegging algorithm for the nonlinear resource allocation problem (Q5959400) (← links)