An APTAS for bin packing with clique-graph conflicts (Q832868): Difference between revisions

@@ Property / cites work @@
+All-Or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns
+Normal rank
@@ Property / cites work @@
+Approximation schemes for scheduling on parallel machines
+Normal rank
@@ Property / cites work @@
+Approximation and online algorithms for multidimensional bin packing: a survey
+Normal rank
@@ Property / cites work @@
+On minimizing the makespan when some jobs cannot be assigned on the same machine
+Normal rank
@@ Property / cites work @@
+On Bin Packing with Conflicts
@@ Property / cites work: On Bin Packing with Conflicts / rank @@
+Normal rank
@@ Property / cites work @@
+Bin packing can be solved within 1+epsilon in linear time
+Normal rank
@@ Property / cites work @@
+Q3002852
@@ Property / cites work: Q3002852 / rank @@
+Normal rank
@@ Property / cites work @@
+An approximation scheme for bin packing with conflicts
+Normal rank
@@ Property / cites work @@
+An EPTAS for Scheduling Jobs on Uniform Processors: Using an MILP Relaxation with a Constant Number of Integral Variables
+Normal rank
@@ Property / cites work @@
+Q4598212
@@ Property / cites work: Q4598212 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for time constrained scheduling
+Normal rank
@@ Property / cites work @@
+Bin packing with restricted piece sizes
@@ Property / cites work: Bin packing with restricted piece sizes / rank @@
+Normal rank
@@ Property / cites work @@
+Q4290987
@@ Property / cites work: Q4290987 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3002782
@@ Property / cites work: Q3002782 / rank @@
+Normal rank