Guaranteed accuracy estimation for the knapsack problem with convex monotone separable functions

MaRDI QIDQ6571916zbMATH OpenFDO

Authors Natallia S. Bogdanova

Publication date 12 July 2024

Published in Izvestiya Gomel'skogo Gosudarstvennogo Universiteta Im. F. Skoriny (Search for Journal in Brave)

zbMATH Keywords

discrete optimizationgradient algorithmguaranteed assessingknapsack problem

Mathematics Subject Classification ID

Numerical analysis (65-XX) Operations research, mathematical programming (90-XX)

Recommendations

• scientific article; zbMATH DE number 431495
• scientific article; zbMATH DE number 3968320
• A penalty algorithm for solving convex separable knapsack problems
• Estimates for the accuracy of solutions of discrete convex optimization problems obtained by a coordinatewise lifting algorithm
• Monotonic optimization techniques for solving knapsack problems

This page was built for publication: Guaranteed accuracy estimation for the knapsack problem with convex monotone separable functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6571916)