NAPHEAP

swMATH23701MaRDI QIDQ35472

No author found.

Described by source

• An Efficient Hybrid Algorithm for the Separable Convex Quadratic Knapsack Problem

Related Items (10)

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

This page was built for software: NAPHEAP