Pages that link to "Item:Q5270754"

The following pages link to An Efficient Hybrid Algorithm for the Separable Convex Quadratic Knapsack Problem (Q5270754):

Displayed 8 items.

• NAPHEAP (Q35472) ‎ (← links)
• A multilevel bilinear programming algorithm for the vertex separator problem (Q683341) ‎ (← links)
• A Newton's method for the continuous quadratic knapsack problem (Q892383) ‎ (← links)
• Variable fixing method by weighted average for the continuous quadratic knapsack problem (Q2074624) ‎ (← links)
• Augmented Lagrangian algorithms for solving the continuous nonlinear resource allocation problem (Q2077958) ‎ (← links)
• Minimum variance allocation among constrained intervals (Q2423792) ‎ (← links)
• A penalty algorithm for solving convex separable knapsack problems (Q2660092) ‎ (← links)
• Projection onto a Polyhedron that Exploits Sparsity (Q2817841) ‎ (← links)