Approximation schemes for packing with item fragmentation (Q927410): Difference between revisions

@@ Property / cites work @@
+Using fast matrix multiplication to find basic solutions
+Normal rank
@@ Property / cites work @@
+Parallel Processor Scheduling with Limited Number of Preemptions
+Normal rank
@@ Property / cites work @@
+Q4826104
@@ Property / cites work: Q4826104 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3651735
@@ Property / cites work: Q3651735 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4938775
@@ Property / cites work: Q4938775 / 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 @@
+A new polynomial-time algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+Complexity of fragmentable object bin packing and an application
+Normal rank
@@ Property / cites work @@
+Scheduling with Deadlines and Loss Functions
@@ Property / cites work: Scheduling with Deadlines and Loss Functions / rank @@
+Normal rank
@@ Property / cites work @@
+Q4778565
@@ Property / cites work: Q4778565 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimizing makespan and preemption costs on a system of uniform machines
+Normal rank
@@ Property / cites work @@
+Q5755520
@@ Property / cites work: Q5755520 / rank @@
+Normal rank
@@ Property / cites work @@
+Smoothed analysis of termination of linear programming algorithms
+Normal rank
@@ Property / cites work @@
+The many facets of linear programming
@@ Property / cites work: The many facets of linear programming / rank @@
+Normal rank