Fast algorithm for the quadratic knapsack problem

DOI10.1134/S1063454122010113zbMath1500.90061OpenAlexW4281723816MaRDI QIDQ2674729

A. V. Plotkin

Publication date: 14 September 2022

Published in: Vestnik St. Petersburg University. Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1063454122010113

zbMATH Keywords

quadratic programmingfast algorithmsknapsack problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Uses Software

• GitHub

Cites Work

• A library for continuous convex separable quadratic knapsack problems
• A survey on the continuous nonlinear resource allocation problem
• Breakpoint searching algorithms for the continuous quadratic knapsack problem
• New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
• Quasi-Newton Updates with Bounds
• Massively Parallel Algorithms for Singly Constrained Convex Programs
• Unnamed Item

This page was built for publication: Fast algorithm for the quadratic knapsack problem