Offline black and white bin packing (Q2355707): Difference between revisions

@@ Property / DOI @@
-.1016/j.tcs.2015.06.045
@@ Property / DOI: 10.1016/j.tcs.2015.06.045 / rank @@
-Normal rank
@@ Property / author @@
-József Békési
@@ Property / author: József Békési / rank @@
-Normal rank
@@ Property / author @@
-György Dósa
@@ Property / author: György Dósa / rank @@
-Normal rank
@@ Property / author @@
+József Békési
@@ Property / author: József Békési / rank @@
+Normal rank
@@ Property / author @@
+György Dósa
@@ Property / author: György Dósa / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Knapsack
@@ Property / describes a project that uses: Knapsack / rank @@
+Normal rank
@@ 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.tcs.2015.06.045
+Normal rank
@@ Property / OpenAlex ID @@
+W1026158760
@@ Property / OpenAlex ID: W1026158760 / rank @@
+Normal rank
@@ Property / cites work @@
+Online results for black and white bin packing
@@ Property / cites work: Online results for black and white bin packing / rank @@
+Normal rank
@@ Property / cites work @@
+Black and White Bin Packing
@@ Property / cites work: Black and White Bin Packing / rank @@
+Normal rank
@@ Property / cites work @@
+A fast asymptotic approximation scheme for bin packing with rejection
+Normal rank
@@ Property / cites work @@
+Online Colored Bin Packing
@@ Property / cites work: Online Colored Bin Packing / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation schemes for ordered vector packing problems
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for knapsack problems with cardinality constraints
+Normal rank
@@ Property / cites work @@
+Q3002852
@@ Property / cites work: Q3002852 / rank @@
+Normal rank
@@ Property / cites work @@
+Handbook of Approximation Algorithms and Metaheuristics
+Normal rank
@@ Property / cites work @@
+Colorful Bin Packing
@@ Property / cites work: Colorful Bin Packing / rank @@
+Normal rank
@@ Property / cites work @@
+Q2957914
@@ Property / cites work: Q2957914 / rank @@
+Normal rank
@@ Property / cites work @@
+Bin packing with rejection revisited
@@ Property / cites work: Bin packing with rejection revisited / rank @@
+Normal rank
@@ Property / cites work @@
+An APTAS for Generalized Cost Variable-Sized Bin Packing
+Normal rank
@@ Property / cites work @@
+Asymptotic fully polynomial approximation schemes for variants of open-end bin packing
+Normal rank
@@ Property / cites work @@
+AFPTAS Results for Common Variants of Bin Packing: A New Method for Handling the Small Items
+Normal rank
@@ Property / cites work @@
+Bin packing with general cost structures
@@ Property / cites work: Bin packing with general cost structures / rank @@
+Normal rank
@@ Property / cites work @@
+Bin packing can be solved within 1+epsilon in linear time
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
+Normal rank
@@ Property / cites work @@
+Fast algorithms for bin packing
@@ Property / cites work: Fast algorithms for bin packing / rank @@
+Normal rank
@@ Property / cites work @@
+An Efficient Approximation Scheme for Variable-Sized Bin Packing
+Normal rank
@@ Property / cites work @@
+Q4290987
@@ Property / cites work: Q4290987 / rank @@
+Normal rank
@@ Property / cites work @@
+On two class-constrained versions of the multiple knapsack problem
+Normal rank
@@ Property / cites work @@
+Approximation schemes for packing with item fragmentation
+Normal rank
@@ Property / cites work @@
+When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
+Normal rank
@@ Property / DOI @@
+.1016/J.TCS.2015.06.045
@@ Property / DOI: 10.1016/J.TCS.2015.06.045 / rank @@
+Normal rank