Packing groups of items into multiple knapsacks

DOI10.1145/3233524MaRDI QIDQ4629965zbMATH OpenOpenAlexWikidataFDO

Authors Lin Chen, Guochuan Zhang

Publication date 28 March 2019

Published in ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL https://drops.dagstuhl.de/opus/volltexte/2016/5729/

zbMATH Keywords

approximation schemesbin packinglower boundsmultiple knapsack

Mathematics Subject Classification ID

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

Recommendations

• Packing groups of items into multiple knapsacks
• Parameterized approximation scheme for the multiple knapsack problem
• scientific article; zbMATH DE number 1445306
• Approximation for multi-knapsack problem
• A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem

Cited in

(9)

• The multiple multidimensional knapsack with family-split penalties
• Multistage knapsack
• Scheduling multiple two-stage flowshops with a deadline
• Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
• Scheduling on multiple two-stage flowshops with a deadline
• On the approximability of the two-phase knapsack problem
• Packing groups of items into multiple knapsacks
• A decomposition approach for multidimensional knapsacks with family‐split penalties
• Fair k-center clustering with minimum representation guarantees

This page was built for publication: Packing groups of items into multiple knapsacks

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