Pages that link to "Item:Q2566930"

The following pages link to An approximate dynamic programming approach to convex quadratic knapsack problems (Q2566930):

Displaying 5 items.

• Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies (Q319183) (← links)
• Simple solution methods for separable mixed linear and quadratic knapsack problem (Q693416) (← links)
• A unified method for a class of convex separable nonlinear knapsack problems (Q930930) (← links)
• Capacity-constrained multiple-market price discrimination (Q1761955) (← links)
• A new variable reduction technique for convex integer quadratic programs (Q2472944) (← links)