Pages that link to "Item:Q4507345"
From MaRDI portal
The following pages link to Allocating Bandwidth for Bursty Connections (Q4507345):
Displayed 33 items.
- Approximation algorithms for stochastic combinatorial optimization problems (Q290321) (← links)
- Robust optimization approach for a chance-constrained binary knapsack problem (Q291067) (← links)
- Stochastic models for budget optimization in search-based advertising (Q603917) (← links)
- Approximation algorithms for multiprocessor scheduling under uncertainty (Q613111) (← links)
- The static stochastic knapsack problem with normally distributed item sizes (Q715062) (← links)
- The structure and complexity of Nash equilibria for a selfish routing game (Q838143) (← links)
- Column generation strategies and decomposition approaches for the two-stage stochastic multiple knapsack problem (Q1652300) (← links)
- Lifting of probabilistic cover inequalities (Q1728321) (← links)
- Range-max queries on uncertain data (Q1745722) (← links)
- Stochastic makespan minimization in structured set systems (Q2118147) (← links)
- An introduction to stochastic bin packing-based server consolidation with conflicts (Q2146367) (← links)
- A column and constraint generation algorithm for the dynamic knapsack problem with stochastic item sizes (Q2246190) (← links)
- Robust optimization-based heuristic algorithm for the chance-constrained knapsack problem using submodularity (Q2300641) (← links)
- Temporal flows in temporal networks (Q2424668) (← links)
- Hedging uncertainty: approximation algorithms for stochastic optimization problems (Q2494510) (← links)
- The multi-Handler knapsack problem under uncertainty (Q2514753) (← links)
- Mathematical models and approximate solution approaches for the stochastic bin packing problem (Q2669539) (← links)
- Robustness to Dependency in Portfolio Optimization Using Overlapping Marginals (Q2797466) (← links)
- Semi-Infinite Relaxations for the Dynamic Knapsack Problem with Stochastic Item Sizes (Q2817835) (← links)
- Relaxation Analysis for the Dynamic Knapsack Problem with Stochastic Item Sizes (Q4646440) (← links)
- Stochastic Load Balancing on Unrelated Machines (Q4991668) (← links)
- Worst-Case Expected Shortfall with Univariate and Bivariate Marginals (Q4995077) (← links)
- Stochastic Makespan Minimization in Structured Set Systems (Extended Abstract) (Q5041742) (← links)
- Extremal Probability Bounds in Combinatorial Optimization (Q5051383) (← links)
- Chance-Constrained Multiple Bin Packing Problem with an Application to Operating Room Planning (Q5084621) (← links)
- (Q5091069) (← links)
- Computation of Exact Bootstrap Confidence Intervals: Complexity and Deterministic Algorithms (Q5130518) (← links)
- Improvements and Generalizations of Stochastic Knapsack and Markovian Bandits Approximation Algorithms (Q5219671) (← links)
- Maximizing Expected Utility for Stochastic Combinatorial Optimization Problems (Q5219721) (← links)
- Adaptive Bin Packing with Overflow (Q5870378) (← links)
- An improved mechanism for selfish bin packing (Q5918389) (← links)
- Maximum box problem on stochastic points (Q5918465) (← links)
- Configuration balancing for stochastic requests (Q6085995) (← links)