Optimal procedures for the discrete time/cost trade-off problem in project networks (Q1266562): Difference between revisions

@@ Property / OpenAlex ID @@
+W2020690189
@@ Property / OpenAlex ID: W2020690189 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal Reduction of Two-Terminal Directed Acyclic Graphs
+Normal rank
@@ Property / cites work @@
+A Fast Algorithm for the Decomposition of Graphs and Posets
+Normal rank
@@ Property / cites work @@
+Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks
+Normal rank
@@ Property / cites work @@
+A Random Activity Network Generator
@@ Property / cites work: A Random Activity Network Generator / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal procedures for the discrete time/cost trade-off problem in project networks
+Normal rank
@@ Property / cites work @@
+The Theory of Networks and Management Science. Part I
+Normal rank
@@ Property / cites work @@
+On the measurement of complexity in activity networks
+Normal rank
@@ Property / cites work @@
+Solving time/cost trade-off problems with discounted cash flows using generalized benders decomposition
+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 @@
+Incremental modular decomposition
@@ Property / cites work: Incremental modular decomposition / rank @@
+Normal rank
@@ Property / cites work @@
+A Dynamic Programming Solution to Cost-Time Tradeoff for CPM
+Normal rank
@@ Property / cites work @@
+An algorithm for hierarchical reduction and decomposition of a directed graph
+Normal rank
@@ Property / cites work @@
+Optimal Sequencing by Modular Decomposition: Polynomial Algorithms
+Normal rank