On the sum minimization version of the online bin covering problem (Q987687): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2010.04.005
+Normal rank
@@ Property / OpenAlex ID @@
+W1981351373
@@ Property / OpenAlex ID: W1981351373 / rank @@
+Normal rank
@@ Property / cites work @@
+On-line and off-line approximation algorithms for vector covering problems
+Normal rank
@@ Property / cites work @@
+On a dual version of the one-dimensional bin packing problem
+Normal rank
@@ Property / cites work @@
+Fair versus unrestricted bin packing
@@ Property / cites work: Fair versus unrestricted bin packing / rank @@
+Normal rank
@@ Property / cites work @@
+A Knapsack Secretary Problem with Applications
@@ Property / cites work: A Knapsack Secretary Problem with Applications / rank @@
+Normal rank
@@ Property / cites work @@
+Q2768348
@@ Property / cites work: Q2768348 / rank @@
+Normal rank
@@ Property / cites work @@
+Online algorithms for a dual version of bin packing
+Normal rank
@@ Property / cites work @@
+Q4439453
@@ Property / cites work: Q4439453 / rank @@
+Normal rank
@@ Property / cites work @@
+Analysis of Greedy Solutions for a Replacement Part Sequencing Problem
+Normal rank
@@ Property / cites work @@
+Q4737165
@@ Property / cites work: Q4737165 / rank @@
+Normal rank
@@ Property / cites work @@
+An asymptotic fully polynomial time approximation scheme for bin covering.
+Normal rank
@@ Property / cites work @@
+Average-Case Analysis of Off-Line and On-Line Knapsack Problems
+Normal rank
@@ Property / cites work @@
+Stochastic on-line knapsack problems
@@ Property / cites work: Stochastic on-line knapsack problems / rank @@
+Normal rank