Pages that link to "Item:Q833589"

The following pages link to Fully polynomial-time approximation schemes for time-cost tradeoff problems in series-parallel project networks (Q833589):

Displaying 3 items.

• A float-path theory and its application to the time-cost tradeoff problem (Q305477) (← links)
• Simplifying the nonlinear continuous time-cost tradeoff problem (Q1697748) (← links)
• Automatic Generation of FPTASes for Stochastic Monotone Dynamic Programs Made Easier (Q5013571) (← links)