Probabilistic bounds for dual bin-packing
From MaRDI portal
Publication:1060845
zbMath0569.68037MaRDI QIDQ1060845
Peter J. Downey, John L. Bruno
Publication date: 1985
Published in: Acta Informatica (Search for Journal in Brave)
Related Items
An exact algorithm for the dual bin packing problem, Integer linear programming models for the skiving stock problem, The skiving stock problem and its relation to hypergraph matchings, Average-case performance analysis of an approximation algorithm for maximum subset sum using recurrence relations, Upper bounds and algorithms for the maximum cardinality bin packing problem., Large proper gaps in bin packing and dual bin packing problems, Average performance of greedy heuristics for the integer knapsack problem., A state-of-the-art review of parallel-machine scheduling research, Combinatorial investigations on the maximum gap for skiving stock instances of the divisible case, 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, An upper bound of \(\Delta(E) < 3 \slash 2\) for skiving stock instances of the divisible case, Dual bin packing with items of random sizes, Heuristic methods and applications: A categorized survey, Probabilistic analysis of a heuristic for the dual bin packing problem, Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem
