A fully polynomial approximation scheme for a knapsack problem with a minimum filling constraint (extended abstract)

DOI10.1007/978-3-642-22300-6_61zbMATH Open1218.68199OpenAlexW242137952MaRDI QIDQ5199285FDOQ5199285

Authors: Zhou Xu, Xiaofan Lai 

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

Recommendations

• The knapsack problem with a minimum filling constraint
• Approximation for knapsack problems with multiple constraints
• Approximation for multi-knapsack problem
• scientific article; zbMATH DE number 1182767
• Knapsack with variable weights satisfying linear constraints

zbMATH Keywords

approximation algorithmFPTASknapsack problemminimum filling constraint

Mathematics Subject Classification ID

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

Cited In (3)

• Title not available (Why is that?)
• Knapsack problems -- an overview of recent advances. I: Single knapsack problems
• Knapsack with variable weights satisfying linear constraints

This page was built for publication: A fully polynomial approximation scheme for a knapsack problem with a minimum filling constraint (extended abstract)

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