| dc.contributor |
Bertsimas, Dimitris |
|
| dc.contributor |
Paschalidis, Ioannis Ch. |
|
| dc.contributor |
Tsitsiklis, John N. |
|
| dc.contributor |
Massachusetts Institute of Technology. Laboratory for Information and Decision Systems. |
|
| dc.date |
2003-04-29T15:40:16Z |
|
| dc.date |
2003-04-29T15:40:16Z |
|
| dc.date |
1994 |
|
| dc.date.accessioned |
2013-06-04T16:16:48Z |
|
| dc.date.available |
2013-06-04T16:16:48Z |
|
| dc.date.issued |
2013-06-05 |
|
| dc.identifier |
http://hdl.handle.net/1721.1/3367 |
|
| dc.identifier.uri |
http://koha.mediu.edu.my:8181/xmlui/handle/1721 |
|
| dc.description |
Dimitris Bertsimas, Ioannis Ch. Paschalidis, John N. Tsitsiklis. |
|
| dc.description |
Includes bibliographical references (p. 22-24). |
|
| dc.description |
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. |
|
| dc.format |
24 p. |
|
| dc.format |
1876970 bytes |
|
| dc.format |
application/pdf |
|
| dc.language |
eng |
|
| dc.publisher |
Massachusetts Institute of Technology, Laboratory for Information and Decision Systems] |
|
| dc.relation |
LIDS-P ; 2242 |
|
| dc.subject |
TK7855.M41 E3845 no.2242 |
|
| dc.title |
Branching bandits and Klimov's problem : achievable region and side constraints |
|