Network decomposition-based benchmark results for the discrete time-cost tradeoff problem (Q1772839): Difference between revisions

@@ Property / cites work @@
+Generating two-terminal directed acyclic graphs with a given complexity index by constraint logic programming
+Normal rank
@@ Property / cites work @@
+Optimal Reduction of Two-Terminal Directed Acyclic Graphs
+Normal rank
@@ Property / cites work @@
+Q4182229
@@ Property / cites work: Q4182229 / rank @@
+Normal rank
@@ Property / cites work @@
+The discrete time-cost tradeoff problem revisited
@@ Property / cites work: The discrete time-cost tradeoff problem revisited / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks
+Normal rank
@@ Property / cites work @@
+Hardness of approximation of the discrete time-cost tradeoff problem
+Normal rank
@@ Property / cites work @@
+Optimal procedures for the discrete time/cost trade-off problem in project networks
+Normal rank
@@ Property / cites work @@
+Optimal design of centralized computer networks
@@ Property / cites work: Optimal design of centralized computer networks / rank @@
+Normal rank
@@ Property / cites work @@
+A Network Flow Computation for Project Cost Curves
+Normal rank
@@ Property / cites work @@
+Q3859552
@@ Property / cites work: Q3859552 / rank @@
+Normal rank
@@ Property / cites work @@
+A Dynamic Programming Algorithm for Decision CPM Networks
+Normal rank
@@ Property / cites work @@
+Critical-Path Planning and Scheduling: Mathematical Basis
+Normal rank
@@ Property / cites work @@
+Complexity of the minimum-dummy-activities problem in a pert network
+Normal rank
@@ Property / cites work @@
+Q3683903
@@ Property / cites work: Q3683903 / rank @@
+Normal rank
@@ Property / cites work @@
+A Dynamic Programming Solution to Cost-Time Tradeoff for CPM
+Normal rank
@@ Property / cites work @@
+Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm
+Normal rank
@@ Property / cites work @@
+On the computational complexity of the minimum-dummy-activities problem in a pert network
+Normal rank