The following pages link to NAPHEAP (Q35472):
Displaying 10 items.
- Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies (Q319183) (← links)
- Fast algorithm for singly linearly constrained quadratic programs with box-like constraints (Q513719) (← 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)
- Solving the continuous nonlinear resource allocation problem with an interior point method (Q1785268) (← 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)
