Add to ORKGIncludes bibliographical references (p. 46-50).Supported by a Presidential Young Investigator Award. DDM-9158118 Supported by matching funds from Draper Laboratory.Dimitris Bertsimas
This dissertation considers several common notions of complexity that arise in large-scale systems o...
A very simple example of an algorithmic problem solvable by dynamic programming is to maximize, over...
International audienceMany stochastic dynamic programming tasks in continuous action-spaces are tack...
Includes bibliographical references (p. 46-50).Supported by a Presidential Young Investigator Award....
Cover title.Includes bibliographical references (p. 44-48).Supported in part by a Presidential Young...
We show that if performance measures in stochastic and dynamic scheduling problems satisfy generaliz...
Includes bibliographical references (p. 19-21).Supported by a Presidential Young Investigator Award....
We propose a mathematical programming approach for the classical PSPACE - hard problem of n restless...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Sloan School of Management, Operations Resea...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Sloan School of Management, Operations Resea...
Includes bibliographical references (p. 48-50).Supported by the National Science Foundation. ECS-855...
In this paper, we propose a new tractable framework for dealing with linear dynamical systems affect...
Optimization is essential in data science literature. The data science optimization studies all opti...
Includes bibliographical references (p. 48-50).Supported by the National Science Foundation. ECS-855...
A Complex System can be defined as a natural, artificial, social, or economic entity whose model inv...
This dissertation considers several common notions of complexity that arise in large-scale systems o...
A very simple example of an algorithmic problem solvable by dynamic programming is to maximize, over...
International audienceMany stochastic dynamic programming tasks in continuous action-spaces are tack...
Includes bibliographical references (p. 46-50).Supported by a Presidential Young Investigator Award....
Cover title.Includes bibliographical references (p. 44-48).Supported in part by a Presidential Young...
We show that if performance measures in stochastic and dynamic scheduling problems satisfy generaliz...
Includes bibliographical references (p. 19-21).Supported by a Presidential Young Investigator Award....
We propose a mathematical programming approach for the classical PSPACE - hard problem of n restless...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Sloan School of Management, Operations Resea...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Sloan School of Management, Operations Resea...
Includes bibliographical references (p. 48-50).Supported by the National Science Foundation. ECS-855...
In this paper, we propose a new tractable framework for dealing with linear dynamical systems affect...
Optimization is essential in data science literature. The data science optimization studies all opti...
Includes bibliographical references (p. 48-50).Supported by the National Science Foundation. ECS-855...
A Complex System can be defined as a natural, artificial, social, or economic entity whose model inv...
This dissertation considers several common notions of complexity that arise in large-scale systems o...
A very simple example of an algorithmic problem solvable by dynamic programming is to maximize, over...
International audienceMany stochastic dynamic programming tasks in continuous action-spaces are tack...