Pages that link to "Item:Q707495"

The following pages link to Project scheduling with irregular costs: complexity, approximability, and algorithms (Q707495):

Displayed 1 item.

• Fully polynomial-time approximation schemes for time-cost tradeoff problems in series-parallel project networks (Q833589) ‎ (← links)