Upper bounds and algorithms for the maximum cardinality bin packing problem. (Q1399594): Difference between revisions

@@ Property / cites work @@
+Probabilistic bounds for dual bin-packing
@@ Property / cites work: Probabilistic bounds for dual bin-packing / rank @@
+Normal rank
@@ Property / cites work @@
+Q4952619
@@ Property / cites work: Q4952619 / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial Analysis of an Efficient Algorithm for Processor and Storage Allocation
+Normal rank
@@ Property / cites work @@
+Bin packing: Maximizing the number of pieces packed
+Normal rank
@@ Property / cites work @@
+Solving Multiple Knapsack Problems by Cutting Planes
+Normal rank
@@ Property / cites work @@
+Probabilistic analysis of a heuristic for the dual bin packing problem
+Normal rank
@@ Property / cites work @@
+Q4941826
@@ Property / cites work: Q4941826 / rank @@
+Normal rank
@@ Property / cites work @@
+An exact algorithm for the dual bin packing problem
+Normal rank
@@ Property / cites work @@
+Heuristic algorithms for the multiple knapsack problem
+Normal rank
@@ Property / cites work @@
+Lower bounds and reduction procedures for the bin packing problem
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0377-2217(02)00466-6
+Normal rank
@@ Property / OpenAlex ID @@
+W1965367287
@@ Property / OpenAlex ID: W1965367287 / rank @@
+Normal rank