Pages that link to "Item:Q3541789"
From MaRDI portal
The following pages link to Fully Polynomial Time Approximation Schemes for Time-Cost Tradeoff Problems in Series-Parallel Project Networks (Q3541789):
Displaying 5 items.
- Project scheduling with irregular costs: complexity, approximability, and algorithms (Q707495) (← links)
- Fully polynomial-time approximation schemes for time-cost tradeoff problems in series-parallel project networks (Q833589) (← links)
- Hardness of approximation of the discrete time-cost tradeoff problem (Q1604050) (← links)
- Approximation algorithms for the discrete time-cost tradeoff problem (Q2757572) (← links)
- Polynomial-time approximation schemes for a class of integrated network design and scheduling problems with parallel identical machines (Q6166913) (← links)
