On the complexity of project scheduling to minimize exposed time (Q2514874): Difference between revisions

@@ Property / cites work @@
+Nash equilibria in competitive project scheduling
@@ Property / cites work: Nash equilibria in competitive project scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+Project scheduling under competition
@@ Property / cites work: Project scheduling under competition / rank @@
+Normal rank
@@ Property / cites work @@
+Interdicting a Nuclear-Weapons Project
@@ Property / cites work: Interdicting a Nuclear-Weapons Project / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling modular projects on a bottleneck resource
+Normal rank
@@ Property / cites work @@
+The Analysis of Activity Networks Under Generalized Precedence Relations (GPRs)
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Quicksort
@@ Property / cites work: Quicksort / rank @@
+Normal rank
@@ Property / cites work @@
+On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees
+Normal rank
@@ Property / cites work @@
+Partially ordered knapsack and applications to scheduling
+Normal rank
@@ Property / cites work @@
+Q3993418
@@ Property / cites work: Q3993418 / rank @@
+Normal rank
@@ Property / cites work @@
+Technical Note—Managing a Secret Project
@@ Property / cites work: Technical Note—Managing a Secret Project / rank @@
+Normal rank
@@ Property / cites work @@
+A pegging approach to the precedence-constrained knapsack problem
+Normal rank