Pages that link to "Item:Q993703"
From MaRDI portal
The following pages link to A new path-based cutting plane approach for the discrete time-cost tradeoff problem (Q993703):
Displaying 16 items.
- Project scheduling with finite or infinite number of activity processing modes -- a survey (Q621683) (← links)
- The discrete time/cost trade-off problem: Extensions and heuristic procedures (Q835571) (← links)
- A note on time/cost tradeoff curve generation for project scheduling with multi-mode resource availability costs (Q840615) (← links)
- A decomposition-based stochastic programming approach for the project scheduling problem under time/cost trade-off settings and uncertain durations (Q991368) (← links)
- Discrete time/cost trade-off problem: a decomposition-based solution algorithm for the budget version (Q1040964) (← links)
- The discrete time-cost tradeoff problem revisited (Q1129886) (← links)
- Optimal procedures for the discrete time/cost trade-off problem in project networks (Q1266562) (← links)
- A hybrid simulation-optimization approach for the robust discrete time/cost trade-off problem (Q1636886) (← links)
- Simplifying the nonlinear continuous time-cost tradeoff problem (Q1697748) (← links)
- Network decomposition-based benchmark results for the discrete time-cost tradeoff problem (Q1772839) (← links)
- New computational results for the discrete time/cost trade-off problem with time-switch constraints (Q1772840) (← links)
- A reduction tree approach for the discrete time/cost trade-off problem (Q2147020) (← links)
- An application of randomized minimum cut to the project time/cost tradeoff problem (Q2489471) (← links)
- New computational results on the discrete time/cost trade-off problem in project networks (Q3157790) (← links)
- Work Package Sizing and Project Performance (Q4971582) (← links)
- Preprocessing the discrete time-cost tradeoff problem with generalized precedence relations (Q6534414) (← links)
