Pages that link to "Item:Q1604050"
From MaRDI portal
The following pages link to Hardness of approximation of the discrete time-cost tradeoff problem (Q1604050):
Displaying 10 items.
- A multi-objective imperialist competitive algorithm for solving discrete time, cost and quality trade-off problems with mode-identity and resource-constrained situations (Q337079) (← links)
- Project scheduling with irregular costs: complexity, approximability, and algorithms (Q707495) (← links)
- Experimental evaluation of simulated annealing algorithms for the time-cost trade-off problem (Q708169) (← links)
- Fully polynomial-time approximation schemes for time-cost tradeoff problems in series-parallel project networks (Q833589) (← links)
- The discrete time/cost trade-off problem: Extensions and heuristic procedures (Q835571) (← links)
- On the discrete time, cost and quality trade-off problem (Q856123) (← links)
- Network decomposition-based benchmark results for the discrete time-cost tradeoff problem (Q1772839) (← links)
- A reduction tree approach for the discrete time/cost trade-off problem (Q2147020) (← links)
- Approximating the discrete time-cost tradeoff problem with bounded depth (Q5918419) (← links)
- Approximating the discrete time-cost tradeoff problem with bounded depth (Q5925637) (← links)
