Knapsack problems with monotonically non-decreasing variable weights (profits) of items

DOI10.1142/S0129054125400015MaRDI QIDQ7263275zbMATH OpenFDO

Authors Fanyu Kong, Yuzhong Zhang

Publication date 12 June 2026

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0129054125400015

zbMATH Keywords

fully polynomial time approximation schemeknapsack problemmonotonically non-decreasing functionspseudo-polynomial time algorithm

Mathematics Subject Classification ID

Computer science (68-XX) Operations research, mathematical programming (90-XX)

Cites work

• A review of four decades of time-dependent scheduling: main results, new topics, and open problems
• A Simple 2-Approximation for Maximum-Leaf Spanning Tree
• Approximation algorithms for partial vertex covers in trees
• Hiding information and signatures in trapdoor knapsacks
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 724323 (Why is no real title available?)
• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• Knapsack problems with position-dependent item weights or profits
• Minimizing total weighted earliness-tardiness on a single machine around a small common due date: an FPTAS using quadratic knapsack
• The knapsack problem: A survey
• Triality, exceptional Lie algebras and Deligne dimension formulas.

This page was built for publication: Knapsack problems with monotonically non-decreasing variable weights (profits) of items

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