On a dual version of the one-dimensional bin packing problem
From MaRDI portal
Publication:3219761
DOI10.1016/0196-6774(84)90004-XzbMath0556.68011OpenAlexW2057764247MaRDI QIDQ3219761
Joseph Y.-T. Leung, David S. Johnson, Daniel J. Kleitman, Susan F. Assmann
Publication date: 1984
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0196-6774(84)90004-x
Related Items (57)
Constant-Ratio Approximation for Robust Bin Packing with Budgeted Uncertainty ⋮ Online bin covering: expectations vs. guarantees ⋮ An exact algorithm for the dual bin packing problem ⋮ Improved approximation algorithms for maximum resource bin packing and lazy bin covering problems ⋮ Integer linear programming models for the skiving stock problem ⋮ Bin packing with divisible item sizes ⋮ \(\mathrm{H}\)-index manipulation by merging articles: models, theory, and experiments ⋮ A polynomial-time approximation scheme for maximizing the minimum machine completion time ⋮ Online algorithms for a dual version of bin packing ⋮ The skiving stock problem and its relation to hypergraph matchings ⋮ Approximation and online algorithms for multidimensional bin packing: a survey ⋮ Probabilistic analysis of a bin covering algorithm ⋮ Ordinal Maximin Share Approximation for Goods ⋮ On-line bin packing ? A restricted survey ⋮ Parameterized on-line open-end bin packing ⋮ Parameterized complexity of max-lifetime target coverage in wireless sensor networks ⋮ Polytopes, permutation shapes and bin packing ⋮ Large proper gaps in bin packing and dual bin packing problems ⋮ An Incentive Mechanism for Selfish Bin Covering ⋮ Solving the skiving stock problem by a combination of stabilized column generation and the reflect arc-flow model ⋮ Online bin covering with limited migration ⋮ Comparing online algorithms for bin packing problems ⋮ Selfish bin covering ⋮ Bin covering with cardinality constraints ⋮ An asymptotic fully polynomial time approximation scheme for bin covering. ⋮ Combinatorial investigations on the maximum gap for skiving stock instances of the divisible case ⋮ Irreducible bin packing and normality in routing open shop ⋮ The proper relaxation and the proper gap of the skiving stock problem ⋮ Characterizing IRDP-instances of the skiving stock problem by means of polyhedral theory ⋮ Integer rounding and modified integer rounding for the skiving stock problem ⋮ Lower bounds and algorithms for the minimum cardinality bin covering problem ⋮ Lower bounds for a bin packing problem with linear usage cost ⋮ An on-line bin-batching problem. ⋮ Class constrained bin covering ⋮ An upper bound of \(\Delta(E) < 3 \slash 2\) for skiving stock instances of the divisible case ⋮ Asymptotic fully polynomial approximation schemes for variants of open-end bin packing ⋮ Bin packing problems with rejection penalties and their dual problems ⋮ A note on an open-end bin packing problem ⋮ On the sum minimization version of the online bin covering problem ⋮ An Improved Upper Bound for the Gap of Skiving Stock Instances of the Divisible Case ⋮ The clever shopper problem ⋮ The maximum resource bin packing problem ⋮ Bin packing with controllable item sizes ⋮ Packing resizable items with application to video delivery over wireless networks ⋮ Online Bin Covering with Limited Migration ⋮ Hardness of lazy packing and covering ⋮ 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 ⋮ Heuristic methods and applications: A categorized survey ⋮ Bin packing with restricted piece sizes ⋮ Bounded-space online bin cover ⋮ Improved flow-based formulations for the skiving stock problem ⋮ Optimal on-line algorithms for variable-sized bin covering ⋮ Online variable sized covering ⋮ Online Bin Covering: Expectations vs. Guarantees ⋮ The generalized assignment problem with minimum quantities
This page was built for publication: On a dual version of the one-dimensional bin packing problem
