Branching bandits and Klimov's problem : achievable region and side constraints
Includes bibliographical references (p. 22-24).
Other Authors: | Bertsimas, Dimitris |
---|---|
Language: | eng |
Published: |
Massachusetts Institute of Technology, Laboratory for Information and Decision Systems]
2003
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/3367 |
Similar Items
-
Relaxation method for linear programs with side constraints
Published: (2003) -
Relaxation methods for problems with strictly convex separable costs and linear constraints
Published: (2003) -
Relaxation methods for problems with strictly convex costs and linear inequality constraints
Published: (2003) -
Dual coordinate ascent for problems with strictly convex costs and linear constraints : a unified approach
Published: (2003) -
LQG control with communication constraints
Published: (2003)