Fully polynomial time approximation schemes for sequential decision problems
Thesis (S.M.)--Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, 2005.
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Language: | eng |
| Published: |
Massachusetts Institute of Technology
2006
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/33673 |
| _version_ | 1826192294099812352 |
|---|---|
| author | Mostagir, Mohamed |
| author2 | James B. Orlin. |
| author_facet | James B. Orlin. Mostagir, Mohamed |
| author_sort | Mostagir, Mohamed |
| collection | MIT |
| description | Thesis (S.M.)--Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, 2005. |
| first_indexed | 2024-09-23T09:09:16Z |
| format | Thesis |
| id | mit-1721.1/33673 |
| institution | Massachusetts Institute of Technology |
| language | eng |
| last_indexed | 2024-09-23T09:09:16Z |
| publishDate | 2006 |
| publisher | Massachusetts Institute of Technology |
| record_format | dspace |
| spelling | mit-1721.1/336732020-11-24T01:48:19Z Fully polynomial time approximation schemes for sequential decision problems Mostagir, Mohamed James B. Orlin. Massachusetts Institute of Technology. Operations Research Center. Massachusetts Institute of Technology. Operations Research Center. Operations Research Center. Thesis (S.M.)--Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, 2005. Includes bibliographical references (p. 65-67). This thesis is divided into two parts sharing the common theme of fully polynomial time approximation schemes. In the first part, we introduce a generic approach for devising fully polynomial time approximation schemes for a large class of problems that we call list scheduling problems. Our approach is simple and unifying, and many previous results in the literature follow as direct corollaries of our main theorem. In the second part, we tackle a more difficult problem; the stochastic lot sizing problem, and give the first fully polynomial time approximation scheme for it. Our approach is based on simple techniques that could arguably have wider applications outside of just designing fully polynomial time approximation schemes. by Mohamed Mostagir. S.M. 2006-07-31T15:22:20Z 2006-07-31T15:22:20Z 2005 2005 Thesis http://hdl.handle.net/1721.1/33673 64567353 eng M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission. http://dspace.mit.edu/handle/1721.1/7582 67 p. 3379932 bytes 3382653 bytes application/pdf application/pdf application/pdf Massachusetts Institute of Technology |
| spellingShingle | Operations Research Center. Mostagir, Mohamed Fully polynomial time approximation schemes for sequential decision problems |
| title | Fully polynomial time approximation schemes for sequential decision problems |
| title_full | Fully polynomial time approximation schemes for sequential decision problems |
| title_fullStr | Fully polynomial time approximation schemes for sequential decision problems |
| title_full_unstemmed | Fully polynomial time approximation schemes for sequential decision problems |
| title_short | Fully polynomial time approximation schemes for sequential decision problems |
| title_sort | fully polynomial time approximation schemes for sequential decision problems |
| topic | Operations Research Center. |
| url | http://hdl.handle.net/1721.1/33673 |
| work_keys_str_mv | AT mostagirmohamed fullypolynomialtimeapproximationschemesforsequentialdecisionproblems |