A Fully Polynomial Approximation Scheme for a Knapsack Problem with a Minimum Filling Constraint

DOI10.1007/978-3-642-22300-6_61zbMath1218.68199OpenAlexW242137952MaRDI QIDQ5199285

Xiaofan Lai, Zhou Xu

Publication date: 12 August 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22300-6_61

zbMATH Keywords

approximation algorithmknapsack problemFPTASminimum filling constraint

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (1)

Knapsack problems -- an overview of recent advances. I: Single knapsack problems

This page was built for publication: A Fully Polynomial Approximation Scheme for a Knapsack Problem with a Minimum Filling Constraint