Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

Branching bandits and Klimov's problem: achievable region and side constraints

12 references·3 citing·38 second hop

FromToDepth

this work references cited by second hop

References

1987Introduction to Queueing Networks688 cited
1982Hitting-time and occupation-time bounds implied by drift analysis with applications420 cited
1975Time-Sharing Service Systems. I285 cited
1994Performance bounds for queueing networks and scheduling policies182 cited
1994Optimization of Multiclass Queueing Networks: Polyhedral and Nonlinear Characterizations of Achievable Performance174 cited
1982Analysis and synthesis of computer systems169 cited
1992Multiclass Queueing Systems: Polymatroidal Structure and Optimal Scheduling Control156 cited
1989Multi-armed bandit allocation indices120 cited
1988Characterization and Optimization of Achievable Performance in General Queueing Systems107 cited
1988Branching Bandit Processes87 cited
1986Optimal priority assignment with hard constraint64 cited
1989Interchange arguments in stochastic scheduling38 cited

Cited by

2017A comparison of Monte Carlo tree search and rolling horizon optimization for large-scale dynamic resource allocation problems46 cited
1999Optimization of Multiclass Queueing Networks with Changeover Times Via the Achievable Region Approach: Part II, The Multi-Station Case27 cited

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work

2014

Robust Fluid Processing Networks

21 cited