An optimal algorithm for online multiple knapsack

DOI10.4230/LIPICS.ICALP.2020.13MaRDI QIDQ6842566zbMATH OpenFDO

Authors Marcin Bienkowski, Maciej Pacut, Krzysztof Piecuch

Publication date 18 March 2026

Copyright license Creative Commons Attribution 3.0 Unported

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2020.13

zbMATH Keywords

competitive analysisbin packingonline knapsackmultiple knapsacks

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cites work

• scientific article; zbMATH DE number 1786227 (Why is no real title available?)
• scientific article; zbMATH DE number 2086630 (Why is no real title available?)
• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• scientific article; zbMATH DE number 1418266 (Why is no real title available?)
• scientific article; zbMATH DE number 7650261 (Why is no real title available?)
• A Knapsack Secretary Problem with Applications
• A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
• An exact algorithm for large multiple knapsack problems
• Encyclopedia of algorithms. In 3 volumes
• Fair versus unrestricted bin packing
• Improved Online Algorithms for Knapsack and GAP in the Random Order Model
• Online knapsack revisited
• Online knapsack with resource augmentation
• Primal beats dual on online packing LPs in the random-order model
• Randomized algorithms for online knapsack problems
• Stochastic on-line knapsack problems
• The online knapsack problem: advice and randomization

Cited in

(1)

• A survey of online knapsack problems

This page was built for publication: An optimal algorithm for online multiple knapsack

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