On an extension of the Sort \& Search method with application to scheduling theory (Q392015): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2013.05.023
+Normal rank
@@ Property / OpenAlex ID @@
+W2010662359
@@ Property / OpenAlex ID: W2010662359 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3425131
@@ Property / cites work: Q3425131 / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling Partially Ordered Jobs Faster Than 2 n
@@ Property / cites work: Scheduling Partially Ordered Jobs Faster Than 2 n / rank @@
+Normal rank
@@ Property / cites work @@
+Q5452284
@@ Property / cites work: Q5452284 / rank @@
+Normal rank
@@ Property / cites work @@
+Exact exponential algorithms.
@@ Property / cites work: Exact exponential algorithms. / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
+Normal rank
@@ Property / cites work @@
+Computing Partitions with Applications to the Knapsack Problem
+Normal rank
@@ Property / cites work @@
+A Functional Equation and its Application to Resource Allocation and Sequencing Problems
+Normal rank
@@ Property / cites work @@
+Scheduling
@@ Property / cites work: Scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+Q4414647
@@ Property / cites work: Q4414647 / rank @@
+Normal rank