Cited in
(11)- Augmented Lagrangian algorithms for solving the continuous nonlinear resource allocation problem
- A penalty algorithm for solving convex separable knapsack problems
- Solving the continuous nonlinear resource allocation problem with an interior point method
- A multilevel bilinear programming algorithm for the vertex separator problem
- Projection onto a polyhedron that exploits sparsity
- PPROJ
- Variable fixing method by weighted average for the continuous quadratic knapsack problem
- Fast algorithm for singly linearly constrained quadratic programs with box-like constraints
- Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies
- Minimum variance allocation among constrained intervals
- A Newton's method for the continuous quadratic knapsack problem
This page was built for software: NAPHEAP
