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