Online algorithms for a dual version of bin packing
From MaRDI portal
Publication:1112608
DOI10.1016/0166-218X(88)90052-2zbMath0659.68069OpenAlexW2002102598MaRDI QIDQ1112608
Publication date: 1988
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(88)90052-2
Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99) Source coding (94A29)
Related Items
Online-bounded analysis ⋮ Online bin covering: expectations vs. guarantees ⋮ An exact algorithm for the dual bin packing problem ⋮ Approximation and online algorithms for multidimensional bin packing: a survey ⋮ On-line bin packing ? A restricted survey ⋮ Exact and approximate methods for the score-constrained packing problem ⋮ Online bin covering with limited migration ⋮ Comparing online algorithms for bin packing problems ⋮ A Simple PTAS for the Dual Bin Packing Problem and Advice Complexity of Its Online Version ⋮ Bin covering with cardinality constraints ⋮ An on-line bin-batching problem. ⋮ Online Bounded Analysis ⋮ Class constrained bin covering ⋮ Asymptotic fully polynomial approximation schemes for variants of open-end bin packing ⋮ Bin packing problems with rejection penalties and their dual problems ⋮ On the sum minimization version of the online bin covering problem ⋮ Bin packing with controllable item sizes ⋮ Online Bin Covering with Limited Migration ⋮ Lower bounds for online bin covering-type problems ⋮ Online bin covering with advice ⋮ Online LIB problems: Heuristics for Bin Covering and lower bounds for Bin Packing ⋮ Bounded-space online bin cover ⋮ Optimal on-line algorithms for variable-sized bin covering ⋮ Online variable sized covering ⋮ Online Bin Covering: Expectations vs. Guarantees
Cites Work
