Packing groups of items into multiple knapsacks

DOI10.4230/LIPICS.STACS.2016.28MaRDI QIDQ4601880zbMATH OpenFDO

Authors Lin Chen, Guochuan Zhang

Publication date 24 January 2018

Full work available at URL https://doi.org/10.4230/LIPICS.STACS.2016.28

zbMATH Keywords

approximation algorithmsbin packinglower boundmultiple 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

(3)

• Multistage knapsack
• Packing groups of items into multiple knapsacks
• Generalized assignment via submodular optimization with reserved capacity

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 Q4601880)