NAPHEAP

swMATH23701MaRDI QIDQ35472FDOQ35472

Author name not available (Why is that?)

Official website: https://dl.acm.org/citation.cfm?doid=2935754.2828635

Described by source

• An efficient hybrid algorithm for the separable convex quadratic knapsack problem

Cited In (11)

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

This page was built for software: NAPHEAP