Probabilistic analysis of algorithms for dual bin packing problems

DOI10.1016/0196-6774(91)90001-FMaRDI QIDQ3361889zbMATH OpenOpenAlexWikidataFDO

Authors J. B. G. Frenk, Gábor Galambos, Alexander H. G. Rinnooy Kan, János Csirik

Publication date 1991

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0196-6774(91)90001-f

zbMATH Keywords

bin packing problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Probabilistic analysis of a heuristic for the dual bin packing problem
• Probabilistic bounds for dual bin-packing
• Probabilistic Analysis of Bin Packing Heuristics
• Probabilistic Analysis of a Generalized Bin Packing Problem and Applications
• Probabilistic behaviour of optimal bin-packing solutions
• scientific article; zbMATH DE number 1052845
• scientific article; zbMATH DE number 52589
• scientific article; zbMATH DE number 176070
• Probabilistic analysis of the dual next-fit algorithm for bin covering

Cited in

(27)

• Bounded-space online bin cover
• Online algorithms for a dual version of bin packing
• Optimal on-line algorithms for variable-sized bin covering
• The skiving stock problem and its relation to hypergraph matchings
• Combinatorial investigations on the maximum gap for skiving stock instances of the divisible case
• Integer rounding and modified integer rounding for the skiving stock problem
• Probabilistic analysis of a heuristic for the dual bin packing problem
• Online variable sized covering
• An exact algorithm for the dual bin packing problem
• Probabilistic analysis of a bin covering algorithm
• An upper bound of \(\Delta(E) < 3 \slash 2\) for skiving stock instances of the divisible case
• Probabilistic analysis of online (class-constrained) bin packing and bin covering
• Approximation and online algorithms for multidimensional bin packing: a survey
• Large proper gaps in bin packing and dual bin packing problems
• Probabilistic analysis of algorithms for the Dutch national flag problem
• Online Bin Covering: Expectations vs. Guarantees
• Online bin covering: expectations vs. guarantees
• scientific article; zbMATH DE number 2127726 (Why is no real title available?)
• Integer linear programming models for the skiving stock problem
• scientific article; zbMATH DE number 52589 (Why is no real title available?)
• scientific article; zbMATH DE number 1305497 (Why is no real title available?)
• scientific article; zbMATH DE number 1052845 (Why is no real title available?)
• Characterizing IRDP-instances of the skiving stock problem by means of polyhedral theory
• The proper relaxation and the proper gap of the skiving stock problem
• Selfish bin covering
• Exact combinatorial algorithms for solving the bin covering problems with strong divisibility and rejection profit
• Packing resizable items with application to video delivery over wireless networks

This page was built for publication: Probabilistic analysis of algorithms for dual bin packing problems

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