Fully polynomial-time approximation schemes for time-cost tradeoff problems in series-parallel project networks (Q833589): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.orl.2009.03.002
+Normal rank
@@ Property / OpenAlex ID @@
+W1978031400
@@ Property / OpenAlex ID: W1978031400 / rank @@
+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 @@
+Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem
+Normal rank
@@ Property / cites work @@
+Hardness of approximation of the discrete time-cost tradeoff problem
+Normal rank
@@ Property / cites work @@
+Project scheduling with irregular costs: complexity, approximability, and algorithms
+Normal rank
@@ Property / cites work @@
+A Dynamic Programming Algorithm for Decision CPM Networks
+Normal rank
@@ Property / cites work @@
+When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
+Normal rank
@@ Property / cites work @@
+Q3579452
@@ Property / cites work: Q3579452 / rank @@
+Normal rank
@@ Property / cites work @@
+The Recognition of Series Parallel Digraphs
@@ Property / cites work: The Recognition of Series Parallel Digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+A Fully Polynomial-Time Approximation Scheme for Single-Item Stochastic Inventory Control with Discrete Demand
+Normal rank
@@ Property / cites work @@
+Graph minors. II. Algorithmic aspects of tree-width
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for NP-complete problems on planar graphs
+Normal rank
@@ Property / cites work @@
+Approximation Schemes for the Restricted Shortest Path Problem
+Normal rank
@@ Property / cites work @@
+Optimal Reduction of Two-Terminal Directed Acyclic Graphs
+Normal rank