Pages that link to "Item:Q833589"
From MaRDI portal
The following pages link to Fully polynomial-time approximation schemes for time-cost tradeoff problems in series-parallel project networks (Q833589):
Displaying 7 items.
- A float-path theory and its application to the time-cost tradeoff problem (Q305477) (← links)
- Hardness of approximation of the discrete time-cost tradeoff problem (Q1604050) (← links)
- Simplifying the nonlinear continuous time-cost tradeoff problem (Q1697748) (← links)
- Approximation algorithms for the discrete time-cost tradeoff problem (Q2757572) (← links)
- Fully Polynomial Time Approximation Schemes for Time-Cost Tradeoff Problems in Series-Parallel Project Networks (Q3541789) (← links)
- Automatic Generation of FPTASes for Stochastic Monotone Dynamic Programs Made Easier (Q5013571) (← links)
- Polynomial-time approximation schemes for a class of integrated network design and scheduling problems with parallel identical machines (Q6166913) (← links)
