Pages that link to "Item:Q3315284"
From MaRDI portal
The following pages link to Analysis of Heuristics for Stochastic Programming: Results for Hierarchical Scheduling Problems (Q3315284):
Displaying 18 items.
- Distribution-free bounds on the expectation of the maximum with scheduling applications (Q751993) (← links)
- New directions in scheduling theory (Q786649) (← links)
- The matroidal knapsack: A class of (often) well-solvable problems (Q797497) (← links)
- On the asymptotic probabilistic analysis of scheduling problems in the presence of precedence constraints (Q909452) (← links)
- Models for robust tactical planning in multi-stage production systems with uncertain demands (Q1046703) (← links)
- An appraisal of computational complexity for operations researchers (Q1173532) (← links)
- Bounds and asymptotic results for the uniform parallel processor weighted flow time problem (Q1317007) (← links)
- On a new class of bilevel programming problems and its use for reformulating mixed integer problems (Q1388924) (← links)
- Stochastic on-line knapsack problems (Q1804369) (← links)
- Multi-constrained matroidal knapsack problems (Q1824560) (← links)
- Computational complexity of stochastic programming problems (Q2492669) (← links)
- Stochastic programming approaches to stochastic scheduling (Q2564886) (← links)
- Solving Hierarchical Stochastic Programs: Application to the Maritime Fleet Renewal Problem (Q2942685) (← links)
- RANDOMIZED DECISION STRATEGY FOR THE HIERARCHICAL OPTIMIZATION PROBLEMS (Q3351130) (← links)
- STOCHASTIC INTEGER PROGRAMMING BY DYNAMIC PROGRAMMING (Q3678972) (← links)
- The double exponential runtime is tight for 2-stage stochastic ILPs (Q5918430) (← links)
- The double exponential runtime is tight for 2-stage stochastic ILPs (Q5925653) (← links)
- Update on the Asymptotic Optimality of LPT (Q6487184) (← links)
