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

DSpace Home
→
Harvested articles مقالات مستوردة من مؤسسات وجامعات عالمية
→
MIT Items
→
View Item

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

Bertsimas, Dimitris; Paschalidis, Ioannis Ch.; Tsitsiklis, John N.; Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.

URI: http://koha.mediu.edu.my:8181/xmlui/handle/1721

Date: 2013-06-05

Description:

Dimitris Bertsimas, Ioannis Ch. Paschalidis, John N. Tsitsiklis.

Includes bibliographical references (p. 22-24).

Supported by a Presidential Young Investigator Award. DDM-9158118 Supported by the ARO. DAAL-03-92-G-0115 Supported with matching funds from Draper Laboratory and the Leaders for Manufacturing Program at MIT.

Show full item record