Packing groups of items into multiple knapsacks

Chen, Lin and Zhang, G (2016) Packing groups of items into multiple knapsacks. In: 33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016. Leibniz International Proceedings in Informatics, LIPIcs (47). Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, 28:1-28:13. ISBN 978-3-95977-001-9 10.4230/LIPIcs.STACS.2016.28

[img] Text
Chen_28_3173812_ny.pdf

Download (633kB)
Item Type: Book Section
Uncontrolled Keywords: Practical problems; Natural generalization; Multiple knapsack problem; LOWER BOUNDS; Inapproximability; Approximation ratios; Profitability; Combinatorial optimization; Multiple knapsack; lower bound; Bin packing; Approximation algorithms
Subjects: Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány
Divisions: Informatics Laboratory
SWORD Depositor: MTMT Injector
Depositing User: MTMT Injector
Date Deposited: 29 Jan 2017 20:29
Last Modified: 29 Jan 2017 20:29
URI: http://eprints.sztaki.hu/id/eprint/9036

Update Item Update Item