mit phd thesis search

• DSpace@MIT Home
• MIT Libraries

This collection of MIT Theses in DSpace contains selected theses and dissertations from all MIT departments. Please note that this is NOT a complete collection of MIT theses. To search all MIT theses, use MIT Libraries' catalog .

MIT's DSpace contains more than 58,000 theses completed at MIT dating as far back as the mid 1800's. Theses in this collection have been scanned by the MIT Libraries or submitted in electronic format by thesis authors. Since 2004 all new Masters and Ph.D. theses are scanned and added to this collection after degrees are awarded.

MIT Theses are openly available to all readers. Please share how this access affects or benefits you. Your story matters.

If you have questions about MIT theses in DSpace, [email protected] . See also Access & Availability Questions or About MIT Theses in DSpace .

If you are a recent MIT graduate, your thesis will be added to DSpace within 3-6 months after your graduation date. Please email [email protected] with any questions.

Permissions

MIT Theses may be protected by copyright. Please refer to the MIT Libraries Permissions Policy for permission information. Note that the copyright holder for most MIT theses is identified on the title page of the thesis.

Theses by Department

• Comparative Media Studies
• Computation for Design and Optimization
• Computational and Systems Biology
• Department of Aeronautics and Astronautics
• Department of Architecture
• Department of Biological Engineering
• Department of Biology
• Department of Brain and Cognitive Sciences
• Department of Chemical Engineering
• Department of Chemistry
• Department of Civil and Environmental Engineering
• Department of Earth, Atmospheric, and Planetary Sciences
• Department of Economics
• Department of Electrical Engineering and Computer Sciences
• Department of Humanities
• Department of Linguistics and Philosophy
• Department of Materials Science and Engineering
• Department of Mathematics
• Department of Mechanical Engineering
• Department of Nuclear Science and Engineering
• Department of Ocean Engineering
• Department of Physics
• Department of Political Science
• Department of Urban Studies and Planning
• Engineering Systems Division
• Harvard-MIT Program of Health Sciences and Technology
• Institute for Data, Systems, and Society
• Media Arts & Sciences
• Operations Research Center
• Program in Real Estate Development
• Program in Writing and Humanistic Studies
• Science, Technology & Society
• Science Writing
• Sloan School of Management
• Supply Chain Management
• System Design & Management
• Technology and Policy Program

Collections in this community

Doctoral theses, graduate theses, undergraduate theses, recent submissions, the pro-apoptotic function of ced-9 requires a ced-9-ced-4 interaction , advancing in-hand dexterous manipulation via machine learning , high speed acoustophoresis for multiphase micron-sized particle assembly .

Show Statistical Information

Theses and Dissertations

View all past theses and dissertations on DSpace@MIT .

Theses and Dissertations in HTC

Thesis and Dissertations in HTC

https://architecture.mit.edu/history-theory-criticism

PhD and Masters Theses

ORC THESES AND THE ORC MISSION

The theses produced at the ORC are a principle way in which the ORC achieves its mission.

Whether you are a member of our doctoral degree (PhD) program or our master’s degree (SM) program in operations research, you will write a thesis based on original, independent research conducted under the guidance of our expert faculty.

Below you will find a listing by year of the research performed by ORC students.

Theses are available on the  DSpace@MIT  online archive. If you would like to request a copy of a thesis, please contact MIT Document Services at 617.253.5650 or [email protected] . 

MIT Document Services owns the copyrights for all MIT student theses.

Boussioux, Léonard  Multimodality: Models, Algorithms, and Applications, June 2023

Chen, Wenyu  Optimization Methods for Machine Learning under Structural Constraints, June 2023

Cummings, Kayla  Toward Microtransit: Design and Operations of Reservation-based Systems, September 2023

Digalakis, Vasileios  Analytics under Variability, Volume, and Velocity with Applications to Sustainability and Healthcare, June 2023

Gilmour, Samuel  Allocating Scarce Resources: Modeling and Optimization, June 2023

Gong, Xiaoyue  Data-Driven Decision Making in Operations Management, June 2023

Liang, Jason Cheuk Nam  Automated Data-driven Algorithm and Mechanism Design in Online Advertising Markets, June 2023

Na, Liangyuan  Optimal Decision Making for Healthcare Operations: Models and Implementation, June 2023

Susan, Fransisca  Online Combinatorial Optimization for Digital Marketplaces, June 2023

Wilde, Joshua  Analytics-Enabled Quality and Safety Management Methods for High-Stakes Manufacturing Applications, February 2023

Zhao, Renbo  New Theory and Algorithms for Convex Optimization with Non-Standard Structures, June 2023

Zheng, Andrew  Experimentation and Control in Online Platforms, June 2023

Baek, Jackie  Decision-Making Under Uncertainty: From Theory to Practice, September 2022

Coey, Christopher Daniel Lang  Interior point and outer approximation methods for conic optimization, May 2022

Cohen, Peter L.  Algorithmic Approaches to Nonparametric Causal Inference, May 2022

Cory-Wright, Ryan  Integer and Matrix Optimization: A Nonlinear Approach, May 2022

Foncea Araneda , Patricio Tomas Learning and Optimization in Modern Retail​, September 2022

Gibson, Emma  Optimizing Healthcare Delivery in Resource-Limited​, September 2022

Kapelevich, Lea  Techniques for handling nonsymmetric cones in interior point algorithms, May 2022

Lahlou Kitane, Driss  Sparsity in Machine Learning: Theory and Applications, February 2022

Li, Michael Lingzhi  Algorithms for Large-scale Data Analytics and Applications to the COVID-19 Pandemic, February 2022

Meigs, Emily  Information and Incentives in Online Platforms​, September 2022

Papalexopoulos, Theodore P.  Multi-Objective Optimization for Public Policy, May 2022

Paskov, Ivan Spassimirov  Stable Machine Learning, February 2022.

Paynter, Jonathan  Modeling Aspects of Military Readiness, May 2022

Skali Lami, Omar  Predictive and Prescriptive Analytics in Operations Management, May 2022

Sobiesk, Matthew  Machine Learning Algorithms and Applications in Health Care, February 2022

Spantidakis, Ioannis  Constrained Inventory Optimization on Complex Warehouse Networks​, September 2022

Wiberg, Holly Mika  Data-driven healthcare via constraint learning and analytics, May 2022

Xu, Qingyang  Financial and Analytic Innovations for Therapeutic Development, May 2022

Amar, Jonathan Z.  Algorithmic Advancements in the Practice of Revenue Management, February 2021.

Bandi, Hari  Improving Efficiency and Fairness in Machine Learning: a Discrete Optimization Approach, September 2021.

Delarue, Arthur  Optimizing School Operations, June 2021.

Hazimeh, Hussein  Sparse Learning using Discrete Optimization: Scalable Algorithms and Statistical Insights, September 2021.

Koduri, Nihal  Essays on Decision Making Under Uncertainty, June 2021.

Orfanoudaki, Agni  Novel Machine Learning Algorithms for Personalized Medicine and Insurance, June 2021.

Paulson, Elisabeth  Healthy Food Access and Consumption: Informing Interventions Through Analytics, September 2021.

Renegar, Nicholas  Predictive Analytics and Machine Learning for the Risk-Based Management of Agricultural Supply Chains, September 2021.

Sinha, Deeksha  Optimization for Online Platforms, February 2021.

Berk, Lauren  New Optimization Approaches to Matrix Factorization Problems with Connections to Natural Language Processing, June 2020.

Chodrow, Philip S.  Structure, Dynamics, and Inference in Networks, September 2020.

Cohen-Hillel, Tamar  Past Price and Trend Effects in Promotion Planning; from Prediction to Prescription, September 2020.

Gaudio, Julia  Investigations in Applied Probability and High-Dimensional Statistics, June 2020.

Hu, Michael  Leveraging Data Analytics to Improve Outpatient Healthcare Operations, February 2020.

Hunter, David  New Approaches to Maximizing Influence in Large-Scale Social Networks, February 2020.

Lamperski, Jourdain Bernard  Structural and Algorithmic Aspects of Linear Inequality Systems, September 2020.

Lu, Jing  Probabilistic Models and Optimization Algorithms for Large-scale Transportation Problems, February 2020.

Pauphilet, Jean  Algorithmic Advancements in Discrete Optimization Applications to Machine Learning and Healthcare Operations, June 2020.

Singhvi, Divya  Data-Driven Decision Making in Online and Offine Retail, September 2020.

Singhvi, Somya  Improving Farmers’ and Consumers’ Welfare in Agricultural Supply Chains via Data-driven Analytics and Modeling: From Theory to Practice, September 2020.

Sturt, Bradley Eli  Dynamic Optimization in the Age of Big Data, June 2020.

Wang, Li  Online and Offline Learning in Operations, September 2020.

Wang, Yuchen  Interpretable Machine Learning Methods with Applications to Health Care, June 2020.

Yan, Julia  From Data to Decisions in Urban Transit and Logistics, June 2020.

Zhang, Kevin  Real-Time Calibration of Large-Scale Traffic Simulators: Achieving Efficiency Through the Use of Analytical Models, September 2020.

Baardman, Lennart  Analytics in Promotional Pricing and Advertising, June 2019.

Beeler, Michael Francis  Inference and Decision Models for Regulatory and Business Challenges in Low-Income Countries, September 2019.

Biggs, Max  Prescriptive Analytics in Operations Problems: a Tree Ensemble Approach, September 2019.

Burq, Maximilien  Dynamic Matching Algorithms, February, 2019.

Chen, Louis Lester  Distributionally Robust Optimization with Marginals: Theory and Applications, September 2019.

Fields, Evan  Demand Uncensored: Inferring Demand for Car-Sharing Mobility Services Using Data-Driven and Simulation-Based Techniques, February, 2019.

Hariss, Rim  Data-driven Optimization with Behavioral Considerations: Applications to Pricing, September 2019.

Lu, Haihao  Large-Scale Optimization Methods for Data-Science Applications, June 2019.

Martin, Sebastien  The Edge of Large-Scale Optimization in Transportation and Machine Learning, June 2019.

McCord, Christopher George  Data-Driven Dynamic Optimization with Auxiliary Covariates, June 2019.

Mellou, Konstantina  Resource Scheduling and Optimization in Dynamic and Complex Transportation Settings, June 2019.

Mundru, Nishanth  Predictive and Prescriptive Methods in Operations Research and Machine Learning: An Optimization Approach, June 2019.

Nambiar, Mila  Data-driven Pricing and Inventory Management with Applications in Fashion Retail, September 2019.

Ng, Yee Sian  Advances in Data-Driven Models for Transportation, June 2019.

Pawlowski, Colin  Machine Learning for Problems with Missing and Uncertain Data with Applications to Personalized Medicine, June 2019.

Tay, Joel  Integrated Robust and Adaptive Methods in the Heating Oil Industry, February, 2019.

Zadik, Ilias  Computational and Statistical Challenges in High Dimensional Statistical Models, September 2019.

Amjad, Muhammad Jehangir  Sequential Data Inference via Matrix Estimation: Causal Inference, Cricket and Retail, September 2018.

Chen, Chongli Daniel  Operations Management in a Large Online Retailer: Inventory, Scheduling and Picking, September 2018.

Copenhaver, Martin Steven  Sparsity and robustness in modern statistical estimation, June 2018.

Dunn, Jack William  Optimal Trees for Prediction and Prescription, June 2018.

Galle, Virgile  Optimization Models and Methods for Storage Yard Operations in Maritime Container Terminals, February 2018.

Goh, Chong Yang  Learning with Structured Decision Constraints, June 2018.

Goh, Siong Thye  Machine Learning Approaches to Challenging Problems: Interpretable Imbalanced Classification, Interpretable Density Estimation, and Causal Inference, June 2018.

Gutin, Eli  Practical Applications of Large-Scale Stochastic Control for Learning and Optimization, September 2018.

Huchette, Joseph Andrew  Advanced mixed-integer programming formulations: Methodology, computation, and application, June 2018.

Li, Andrew A.  Algorithms for Large-Scale Personalization, June 2018.

Ma, Will (Wei)  Dynamic, Data-driven Decision-making in Revenue Management, September 2018.

Owen, Zachary Davis Owen  Revenue Management and Learning in Systems of Reusable Resources, June 2018.

Papush, Anna  Data-Driven Methods for Personalized Product Recommendation Systems, February 2018.

Pixton, Clark  Operational Decisions and Learning for Multiproduct Retail, June 2018.

Tracà, Stefano  Regulating exploration in multi-armed bandit problems with time patterns and dying arms, June 2018.

Udwani, Rajan  Vignettes on Robust Combinatorial Optimization, September 2018.

Wang, Shujing  Improving Behavioral Decision Making in Operations and Food Safety Management, September 2018.

Zhuo, Ying Daisy  New Algorithms in Machine Learning with Applications in Personalized Medicine, June 2018.

Aouad, Mohammed  Revenue Management in Face of Choice Heterogeneity, September 2017.

Cheung, Wang Chi  Data-driven Algorithms for Operational Problems, February 2017.

Eschenfeldt, Patrick Clark  Multiserver Queueing Systems in Heavy Traffic, February 2017.

Flajolet, Arthur  Adaptive Optimization Problems under Uncertainty with Limited Feedback, June 2017.

Gupta, Swati  Combinatorial Structures in Online and Convex Optimization, June 2017.

Korolko, Nikita  A Robust Optimization Approach to Online Problems, June 2017.

Kung, Jerry Lai  An Analytics Approach to Problems in Health Care, June 2017.

Lubin, Miles  Mixed-Integer Convex Optimization: Outer Approximation Algorithms and Modeling Power, September 2017.

Marks, Christopher E.  Analytic Search Methods in Online Social Networks, June 2017.

Thraves Cortés-Monroy, Charles Mark  New Applications in Revenue Management, June 2017.

Weinstein, Alexander Michael  From Data to Decisions in Healthcare: An Optimization Perspective, June 2017.

Yan, Chiwei  Airline Scheduling and Air Traffic Control: Incorporating Passenger and Airline Preferences and Uncertainty, September 2017.

Dunning, Iain  Robert Advances in Robust and Adaptive Optimization: Algorithms, Software, and Insights, June 2016.

Grigas, Paul  Methods for Convex Optimization and Statistical Learning, September 2016.

Misic, Velibor  V. Data, Models and Decisions for Large-Scale Stochastic Optimization Problem, June 2016.

Remorov, Alexander  Dynamic Trading and Behavioral Finance, June 2016.

Shaposhnik, Yaron  Exploration vs. Exploitation: Reducing Uncertainty in Operational Problems, September 2016.

Shi, Peng  Prediction and Optimization in School Choice, June 2016.

Wang, He  Dynamic Learning and Optimization for Operations Management Problems, June 2016.

Youssef, Nataly  Stochastic Analysis via Robust Optimization, February 2016.

Yuan, Rong  Velocity-based Storage and Stowage Decisions in a Semi-automated Fulfillment System, September 2016.

Bisias, Dimitrios  Applications of Optimal Portfolio Management, September 2015.

Calmon, Andre du Pin  Reverse Logistics for Consumer Electronics: Forecasting Failures, Managing Inventory, and Matching Warranties, June 2015.

Cohen, Maxime C.  Pricing for Retail, Social Networks and Green Technologies, September 2015.

Fagnan, David Erik  Analytics for Financing Drug Development, June 2015.

Johnson, Kris  Analytics for Online Markets, June 2015.

Kallus, Nathan  From Data to Decisions Through New Interfaces Between Optimization and Statistics, June 2015.

King, Angela  Regression under a Modern Optimization Lens, June 2015.

Letham, Benjamin  Statistical Learning for Decision Making: Interpretability, Uncertainty, and Inference, June 2015.

Lin, Maokai   Optimization and Equilibrium in Dynamic Networks and Applications in Traffic Systems, February 2015.

Silberholz, John  Analytics for Improved Cancer Screening and Treatment, September 2015.

Wang, Hai  Design and Operation of a Last Mile Transportation System, June 2015.

Anderson, Ross Michael   Stochastic Models and Data Driven Simulations for Healthcare Operations, June 2014.

Elmachtoub, Adam Nabil   New Approaches for Integrating Revenue and Supply Chain Management, September, 2014.

Gupta, Vishal   Data-Driven Models for Uncertainty and Behavior, June 2014.

Leung, Ngai-Hang Zachary   Three Essays in Operations Management, September, 2014.

Zhu, Zhe   New Statistical Techniques for Designing Future Generation Retirement and Insurance Solutions, September, 2014.

Bandi, Chaithanya   Tractable Stochastic Analysis in High Dimensions via Robust Optimization, June 2013.

Chiraphadhanakul, Virot   Large-Scale Analytics and Optimization in Urban Transportation: Improving Public Transit and Its Integration with Vehicle-Sharing Services, June 2013.

Figueroa, Cristian Ricardo  Emission Regulations in the Electricity Market: An Analysis from Consumers, Producers and Central Planner Perspectives, September 2013.

Fontana, Matthew William  Optimal Routes for Electric Vehicles Facing Uncertainty, Congestion, and Energy Constraints, September 2013.

Keller, Philipp Wilhelm   Tractable Multi-product Pricing under Discrete Choice Models, June 2013.

Lu, Xin   Online Optimization Problems, June 2013.

Monsch, Matthieu  Large Scale Prediction Models and Algorithms, September 2013.

O’Hair, Allison Kelly   Personalized Diabetes Management, June 2013.

Simchi-Levi, David   Effectiveness and Design of Sparse Process Flexibilities, June 2013.

Uichanco, Joline Ann Villaranda  Data-driven Optimization and Analytics for Operations Management Applications, September 2013.

Acimovic, Jason Andrew    Lowering Outbound Shipping Costs in an Online Retail Environment by Making Better Fulfillment and Replenishment Decisions, September 2012.

Chang, Allison An    Integer Optimization Methods for Machine Learning, June 2012.

Frankovich, Michael Joseph  Air Traffic Flow Management at Airports: A Unified Optimization Approach, September 2012.

Gupta, Shubham    A Tractable Optimization Framework for Air Traffic Flow Management Addressing Fairness, Collaboration and Stochasticity, June 2012.

Lobel, Ruben  Pricing and Incentive Design in Applications of Green Technology Subsidies and Revenue Management, June 2012.

Shi, Cong  Provably Near-Optimal Algorithms for Multi-stage Stochastic Optimization Models in Operations Management, September 2012.

Sun, Wei  Price of Anarchy in Supply Chains, Congested Systems and Joint Ventures, September 2012.

Telha Cornejo, Claudio    Algorithms and Hardness Results for the Jump Number Problem, the Joint Replenishment Problem, and the Optimal Clustering of Frequency-Constrained Maintenance Jobs, February 2012.

Teytelman, Anna  Modeling Reduction of Pandemic Influenza Using Pharmaceutical and Non-Pharmaceutical Interventions in a Heterogeneous Population, June 2012.

Zhong, Yuan  Resource Allocation in Stochastic Processing Networks: Performance and Scaling, September 2012.

Becker, Adrian Bernard Druke    Decomposition Methods for Large Scale Stochastic and Robust Optimization Problems, September 2011.

Chhaochhria, Pallav  Forecast-driven Tactical Planning Models for Manufacturing Systems, September 2011.

Dunkel, Juliane    The Gomory-Chv´atal Closure: Polyhedrality, Complexity, and Extensions, June 2011.

Goldberg, David Alan    Large Scale Queueing Systems: Asymptotics and Insights, June 2011.

Kluberg, Lionel J.    Competition and Loss of Eciency: From Electricity Markets to Pollution Control, June 2011.

Michalek Pfeil, Diana  Optimization of Airport Terminal-Area Air Traffic Operations under Uncertain Weather Conditions, June 2011.

Mittal, Shashi  Algorithms for Discrete, Non-Linear and Robust Optimization Problems with Applications in Scheduling and Service Operations, September 2011.

Rikun, Alexander Anatolyevich  Applications of Robust Optimization to Queueing and Inventory Systems, June 2011.

Sun, Xu Andy  Advances in Electric Power Systems: Robustness, Adaptability, and Fairness, September 2011.

Trichakis, Nikolaos K.  Fairness in Operations: From Theory to Practice, June 2011.

Williams, Gareth Pierce  Dynamic Order Allocation for Make-To-Order Manufacturing Networks: An Industrial Case Study of Optimization Under Uncertainty, June 2011.

Zarybnisky, Eric Jack  Maintenance Scheduling for Modular Systems–Models and Algorithms, September 2011.

Bimpikis, Kostas  Strategic Delay and Information Exchange in Endogenous Social Networks, September 2010. 

Doan, Xuan Vinh  Optimization under Moment, Robust, and Data-Driven Models of Uncertainty, February 2010. 

Fearing, Douglas  The Case for Coordination: Equity, Efficiency and Passenger Impacts in Air Traffic Flow Management, Septmeber 2010. 

Iancu, Dan Andrei  Adaptive Robust Optimization with Applications in Inventory and Revenue Management, Septmeber 2010. 

Menjoge, Rajiv  New Procedures for Visualizing Data and Diagnosing Regression Models, June 2010. 

Weber, Theophane  Correlation Decay and Decentralized Optimization in Graphical Models, February 2010. 

Harsha, Pavithra  – Mitigating Airport Congestion: Market Mechanisms and Airline Response Models, February 2009.

Lobel, Ilan  – Social Networks: Rational Learning and Information Aggregation, September 2009.

Lu, Ye –  Essays on Inventory, Pricing and Financial Trading Strategies, September 2009.

Nguyen, Tri-Dung  – Robust Estimation, Regression and Ranking with Applications in Portfolio Optimization, June 2009.

Nigmatulina, Karima Robert  – Modeling and Responding to Pandemic Influenza: Importance of Population Distributional Attributes and Non-Pharmaceutical Interventions, June 2009.

Stratila, Dan  – Combinatorial Optimization Problems with Concave Costs, February 2009.

Bjarnadottir, Margret  – Data-Driven Approach to Health Care: Applications Using Claims Data, September 2008.

Chandler, Lincoln J.  – The Minority Achievement Gap in a Suburban School District, June 2008.

Czerwinski, David  – Quality of Care and Drug Surveillance: A Data-Driven Perspective, June 2008.

Mamani, Hamed  – Supply Chain Coordination and Influenza Vaccination, September 2008.

Pei, Pamela  – Towards a Unified Theory of Procurement Contract Design: Production Flexibility, Spot Market Trading, and Contract Structure, June 2008.

Rogozhnikov, Dmitriy  – Algorithmic issues in queueing systems and combinatorial counting problems, September 2008.

Shah, Premal  – Analysis of Employee Stock Options and Guaranteed Withdrawal Benefits for Life, September 2008.

Uhan, Nelson  – Algorithmic and Game-Theoretic Perspectives on Scheduling, June 2008.

Chan, Timothy  – Optimization under Uncertainty in Radiation Therapy, June 2007.

Goundan, Pranava  – Essays on Optimization and Incentive Contracts, June 2007.

Kaminski, Kathryn  – General Superposition Strategies and Asset Allocation, June 2007.

Le-Tallec, Yann  – Robust, Risk-Sensitive, and Data-driven Control of Markov Decision Processes, February 2007.

Shum, Wanhang  – Effective Contracts in Supply Chains, June 2007.

Simon, Carine  – Dynamic Pricing with Demand Learning under Competition, September 2007.

Sivaraman, Raghavendran  – Capacity Expansion in Contemporary Telecommunication Networks, September 2007.

Teo, Kwong Meng  – Nonconvex Robust Optimization, June 2007.

Adida, Elodie  – Dynamic Pricing and Inventory Control with no Backorders under Uncertainty and Competition, June 2006.

Gupta, Shobhit  – Buyout Prices in Online Auctions, June 2006.

McCann, Lauren  – Robust Model Selection and Outlier Detection in Linear Regression, June 2006.

Meyers, Carol  – Network Flow Problems and Congestion Games: Complexity and Approximation Results, June 2006.

Nogueira, Alexandre  – Studies Integrating Geometry, Probability, and Optimization Under Convexity, June 2006.

Roels, Guillaume  – Information and Decentralization in Inventory, Supply Chain, and Transportation Systems, June 2006.

Wagner, Michael  – Online Optimization in Routing and Scheduling, June 2006.

Yee, Michael  – Inferring Noncompensatory Choice Heuristics, June 2006.

Aghassi, Michele Leslie – Robust Optimization, Game Theory, and Variational Inequalities, September 2005.

Bompadre, Agustin – Three Essays on Sequencing and Routing Problems, June 2005.

Martonosi, Susan Elizabeth – An Operations Research Approach to Aviation Security, September 2005.

Xu, Ping Josephine – Order Fulfillment in Online Retailing: What Goes Where, September 2005.

Kang, Laura Sumi  – Degradable Airline Scheduling: an Approach to Improve Operational Robustness and Differentiate Service Quality, February 2004.

Correa, José Rafael  – Approximation Algorithms for Packing and Scheduling Problems, June 2004.

Craft, David  – Local Energy Management Through Mathematical Modeling and Optimization, September 2004.

Farahat, Amr  – Tractability Through Approximation: A Study of Two Discrete Optimization Problems, September 2004.

Lesnaia, Ekaterina  – Optimizing Safety Stock Placement in General Network Supply Chains, September 2004.

Martínez-de-Albéniz, Victor  – Portfolio Strategies in Supply Contracts, June 2004.

Sim, Melvyn  – Robust Optimization, June 2004.

Sood, Anshul  – Competitive Multi-period Pricing for Perishable Products, June 2004.

Stier-Moses, Nicolás E. –  Selfish Versus Coordinated Routing in Network Games, June 2004.

Zaretsky, Marina  – Essays on Variational Inequalities and Competitive Supply Chain Models, September 2004.

Beil, Damian  Two Topics in Online Auctions, June 2003.

Chen, Xin  Coordinating Inventory Control and Pricing Strategies, June 2003.

De boer, Sanne  Advances in Airline Revenue Management and Pricing, June 2003.

Hawkins, Jeffrey  A Largrangian Decomposition Approach to Weakly Coupled Dynamic Optimization Problems and its Applications, June 2003.

Kumar, Mahesh  Error-based Clustering and Its Application to Sales Forecasting in Retail Merchandising, September 2003.          

Mersereau, Adam  Dynamic Optimization for Adaptive Customized Marketing, September 2003.    

Shioda, Romy  Integer Optimization in Data Mining, June 2003.

Sun, Peng  Constructing Learning Models from Data: The Dynamic Catalog Mailing Problem, June 2003. 

Wu, Joseph T.  Optimization of Influenza Vaccine Strain Selection, June 2003.

Bossert, John  Modeling and Solving Variations of the Network Loading Problem, September 2002.

Cohn, Amy E.  Composite-Variable Modeling for Large-Scale Problems in Transportation and Logistics, June 2002. 

Kachani, Soulaymane  Dynamic Travel Time Models for Pricing and Route Guidance: A Fluid Dynamics Approach, June 2002.

Muharremoglu, Alp  A New Perspective on Multi-Echelon Inventory Systems, September 2002.

Ordonez, Fernando  On the Explanatory Value of Condition Numbers for Convex Optimization: Theoretical Issues and Computational Experience, September 2002.

Pachamanova, Dessislava A.  A Robust Optimization Approach to Finance, June 2002. 

Rifkin, Ryan  Everything Old is New Again: A Fresh Look at Historical Approaches in Machine Learning, September 2002.

Sharma, Dushyant  Cyclic Exchange and Related Neighborhood Structures for Combinatorial Optimization Problems, June 2002.

Ergun, Ozlem  New Neighborhood Search Algorithms Based on Exponentially Large Neighborhoods, June 2001. 

Haugh, Martin B.  Essays in Financial Engineering, September 2001. 

Humair, Salal  Yield Management for Telecommunication Networks: Defining a New Landscape, February 2001. 

Lauprete, Geoffrey J.  Portfolio Risk Minimization under Departures from Normality, September 2001

Armacost, Andrew P.  Composite Variable Formulation for Express Shipment Service Network Design, September 2000. 

Chew, Elaine  Towards a Mathematical Model of Tonality, February 2000. 

Demir, Ramazan  An Approximate Dynamic Programming Approach to Discrete Optimization, June 2000. 

Gallien, Jérémie  Optimization-Based Auctions and Stochastic Assembly Replenishment Policies for Industrial Procurement, June 2000. 

Hollywood, John S.  Performance Evaluation and Optimization Models for Processing Networks with Queue-Dependent Production Quantities, June 2000. 

Hsu, Leon C.  The Bottleneck Phenomenon in Scheduling of Transportation Systems, February 2000. 

Taylor, Jonathan D.  Essays on the Empirical Properties of Stock and Mutual Fund Returns, June 2000.

Croxton, Keely L.,  Modeling and Solving Network Flow Problems with Piecewise Linear Costs, with Applications in Supply Chain Management, September 1999. 

Epelman, Marina,  Complexity, Condition Numbers and Conic Linear Systems, June 1999.    

Hall, William,  Efficient Capacity Allocation in a Collaborative Air Transportation System, June 1999.   

Nemec, Joseph,  Diffusion and Decompostition Approximations of Stochastic Models of Muolticlass Processing Networks, February 1999.   

Popescu, Ioana,  Application of Optimization in Probability, finance and Revenue Management, June 1999.   

Sethuraman, Jayachandran,  Scheduling Multiclass Queueing Networks and Job Shops using Fluid and Semidefinite Relaxation, September 1999. 

Sokol, Joel,  Optimizing Paint Blocking in an Automobile Assembly Line: An Application of Specialized TSP1s, June 1999.

Chryssikou, Efthalia,  Multiperiod Portfolio Optimization in the Presence of Transaction Costs, June 1998.   

D’Amato, Rebecca,  Management of Antiretroviral Therapy for HIV Infection: Modeling When to Change Therapy, June 1998.    

Epstein, Rafael,  Linear Programming and Capacitated Network Loading, February 1998.   

Gamarnik, David,  Stability and Performance of Multiclass Queueing Networks, February 1998. 

Hauksson, Arni,  The Commercialization of University Research Discoveries: Are University Technology Transfer Offices Stimulating the Process? February 1998. 

Kniker, Timothy,  Itinerary-Based Airline Fleet Assignment, June 1998.

Osuna, Edgar,  Support Vector Machines: Training and Applications, June 1998.   

Ruark, John,  Implementing Reusable Solvers: An Object-Oriented Framework for Operations Research Algorithms, June 1998.     

Toktay, Latife Beril,  Analysis of a Production-Inventory System under a Stationary Demand Process and Forecast Updates, June 1998. 

Wang, Yi,  Modeling and Solving Single and Multiple Facility Network Restoration Problems, June 1998.

Christodouleas, James,  Solution Methods for Multiprocessor Network Scheduling Problems, with Application to Railroad Operations” June 1997. 

Nunez Araya, Manuel A.,  Condition Numbers and Properties of Central Trajectories in Convex Programming, September 1997.    

Patterson, Sarah Stock,  Dynamic Flow Management Problems in Air Transportation, June 1997.

Aggarwal, Charu C.,  Faster Algorithms for Some Network Flow Problems, June 1996.   

Bonvik, Asbjoern M.,  Performance Analysis of Manufacturing Systems Under Hybrid Control Policies, June 1996. 

Fang, Yue,  Volatility Modeling and Estimation of High-Frequency Data with Gaussian Noise, June, 1996.   

Markowitz, David M.,  A Unified Approach to Single Machine Scheduling: Heavy Traffic Analysis of Dynamic Cyclic Policies, June 1996.   

Pinker, Edieal J.,  Models of Flexible Workforce Management in Uncertain Environments, June 1996.    

Miller, Michael G.,  Optimal Allocation of Resources to Clinical Trials, September 1996.  

Rimm-Kaufman, Alan P.,  Risk Mitigation Models for a Japanese Railroad,” June 1996.   

Teo, Chung-Piaw,  Constructing Approximation Algorithms Via Linear Programming Relaxations: Primal Dual and Randomized Rounding Techniques, September 1996.  

Zenios, Stefanos A.,  Health Care Applications of Optimal Control Theory, June 1996.

Burman, Mitchell H.,  New Results in Flow Line Analysis, June 1995.   

Chi, Zhihang,  Airline Yield Management in a Dynamic Network Environment, February 1995. 

Luo, Xiao-Dong,  Continuous Linear Programming: Theory, Algorithms and Applications, September 1995.     

Malone, Kerry M.,  Dynamic Queueing Systems: Behavior and Approximations for Individual Queues and for Networks, June 1995.   

Milner, Joseph,  Dynamic Slot Allocation with Airline Participation, June 1995. 

Mourtzinou, Georgia,  An Axiomatic Approach to Queueing Systems, June 1995.   

Nino-Mora, Jose,  Optimal Resource Allocation in a Dynamic and Stochastic Environment: A Mathematical Programming Approach, June 1995.   

Raghavan, S.,  Formulations and Algorithms for Network Design Problems with Connectivity Requirements, February 1995.   

Ricard, Michael J.,  Optimization of Queueing Networks: An Optimal Control Approach, June 1995.     

Rubio, Rodrigo,  Dynamic-Stochastic Vehicle Routing and Inventory Problem, September 1995.   

Shumsky, Robert A.,  Dynamic Statistical Models for the Prediction of Aircraft Take-off Times, September 1995.   

Theodosopoulos, Theodore V.,  Stochastic Models for Global Optimization, June 1995.

Huang, Yen-Chin,  Empirical Distribution Function Statistics, Speed of Convergence, and p-Variation, June 1994.  

Ingolfsson, Armann,  Earthquake Forecasts: The Life-Saving Potential of Last-Minute Warnings, September 1994.   

Klaassen, Pieter ,  Stochastic Programming Models for Interest-Rate Risk Management,” June 1994. 

Ramakrishnan, V.S.,  On Cuts and Clutters, September 1994.   

Staats, Richard C.,   Integration of Predictive Routing Information with Dynamic Traffic Signal Control, September 1994.

Mondschein, Susana V.,  Optimal Sales Strategies in Stochastic, Dynamic Environments, June 1993.   

Srivatsan, Narayanan,  Synthesis of Optimal Policies for Stochastic Manufacturing Systems, September 1993.

Athaide, Christopher,  Capacity Allocation and Safety Stocks in Manufacturing Systems, February 1992.   

Chevalier, Philippe,  Two Topics in Multistage Manufacturing Systems, June 1992. 

Gopalan, Ramasubramanian,  Exploiting Process Flexibility in Metal Forming Operations, September 1992.   

Hall, Susan A.,  New Directions in Queue Inference for Management Implementation, June 1992. 

Kodialam, Muralidharan,  The O-D Shortest Path Problem and Connectivity Problems on Periodic Graphs, February 1992. 

Pappu, Suguna,  Production Planning with Due-Date Constraints, June 1992.   

Polychronopoulos, George,  Stochastic and Dynamic Shortest Distance Problems, June 1992.   

Veatch, Michael H.,  Queueing Control Problems for Production/Inventory Systems, September 1992.   

Vranas, Peter B.,  The Multi-Airport Ground-Holding Problem in Air Traffic Control, June 1992. 

Abe, Makoto,  A Marketing Mix Model Developed From Single Source Data: A Semiparametric Approach, September 1991.     

Bai, Sherman X. , Scheduling Manufacturing Systems with Work-in-Process Inventory Control, September 1991. 

Ballman, Karla V.,  Cost-Effectiveness of Smart Traffic Signals, June 1991. 

Gau, Shiow-Hwa,  Server Management in Queueing System, February 1991. 

Ou, Jihong,  Dynamic Scheduling of Queueing Networks, September 1991.     

Richetta, Octavio,  Ground Holding Strategies for Air Traffic Control Under Uncertainty, June 1991.     

Talluri, Kalyan T.,  Issues in the Design and Analysis of Survivable Networks, September 1991.   

Van Ryzin, Garrett,  Stochastic and Dynamic Vehicle Routing in Euclidean Service Regions, June 1991.     

Venkatakrishnan, C.S.,  Analysis and Optimization of Terminal Area Air Traffic Control Operations, February 1991.

Caulkins, Jonathan P.,  The Distribution and Consumption of Illicit Drugs: Some Mathematical Models and Their Policy Implications, June 1990. 

Goemans, Michel X.,  Analysis of Linear Programming Relaxations for a Class Connectivity Problems, September 1990. 

Nakazato, Daisuke,  Transient Distributional Results in Queues with Applications to Queueing Networks, September 1990. 

Tan, Kok-Choon,  Newton’s Method for Parametric Center Problems, June 1990. 

Zhang, Hongtao,  Cyclic Scheduling in a Stochastic Environment, June 1990.

Eckstein, Jonathan –  Splitting Methods for Monotone Operators With Applications to Parallel Optimization, September 1989

Hall, Leslie A. –  Two Topics in Discrete Optimization: Polyhedral Structure of Capacitated Trees and Approximation Algorithms for Scheduling, September 1989

Luo, Zhi-Quan (Tom) – Communication Complexity of Some Problems in Distributed Computation, September 1989

Webb, Ian R. –  Period and Phase of Customer Replenishment: A New Approach to Inventory / Routing Problem, June 1989

Abraham, Magid M. –  Retailer Forward Buying of Consumer Goods, June 1988

Bertsimas, Dimitris J. –  Probabilistic Combinatorial Optimization Problems, September 1988

Boyd, E. Andrew –  Optimization Problems on Greedoids, February 1988

Thompson, Paul M. –  Local Search Algorithms for Vehicle Routing and Other Combinatorial Problems, June 1988

Wagner, Janet M. –  Stochastic Programming and Recourse Applied to Groundwater Quality Management, June 1988

Gordon, Ethel-Sherry –  New Problems in Queues: Social Injustice and Server Production Management, June 1987

Marujo, Ernesto –  Dynamic Allocation of Machines to Product Families in the Presence of Setup Delays, September 1987

Qiu, Yuping –  Sensitivity Analysis for Variational Inequalities, June 1987

Chapman, Paul T. –  Decision Models for Multistage Production Planning, February 1986

Cox, Jr., Louis A. –  Mathematical Foundations of Risk Measurement, June 1986

Hiller, Randall –  Stochastic Programming Approximation Methods with Applications to Multistage Production Planning, September 1986

Leung, Janny M. Y. –  Polyhedral Structure of Capacitated Fixed Charge Problems and A Problem in Delivery Route Planning, February 1986

MacDonald, Bruce –  A Generalized Model for the Prediction of Controller Intervention Rates in the En Route Air Traffic Control System, September 1986

Schaack, Christian –  Cutoff Priority Queues: A Methodology for Police Patrol Dispatching, February 1986

Tseng, Paul –  Relaxation Methods for Monotopic Programming Problems, June 1986

Yee, James R. –  Distributed Routing and Flow Control Algorithms for Communications Networks, February 1986

Bienstock, Daniel –  Large-Scale Reliability, September 1985

Haimovich, Mordecai –  Large Scale Geometric Location Problems, February 1985

Hammond, Janice H. –  Solving Asymmetric Variational Inequality Problems and Systems of Equations with Generalized Nonlinear Programming Algorithms, February 1985

Lo Faso, Anthony J. –  On the Optimal Allocation of Prison Space, February 1985

Lamar, Bruce W. –  Network Design Algorithms with Applications to Freight Transportation, September 1985

Minkoff, Alan S. –  Real-Time Dispatching of Delivery Vehicles, September 1985

Vande Vate, John H. –  The Linear Matroid Parity Problem, February 1985

Batta, Rajan –  Facility Location in the Presence of Congestion, September 1984

Kaplan, Edward H. –  Managing the Demand for Public Housing, June 1984

Luque, Fernando Javier Rodilla –  Nonlinear Proximal Point Algorithms, June 1984

Matsuo, Hirofumi –  The Capacitated Lot Size Problems, June 1984

Bier, Vicki M. –  A Measure of Uncertainty Importance for Components in Fault Trees, February 1983

Constantopoulos, Panagiotis C. –  Computer-Assisted Control of Electricity Usage By Consumers, June 1983

D’Aversa, Joseph Salvatore –  Numerical Methods for Group Theoretic Integer Programming, June 1983

Huang, Kuan-Tsae –  Query Optimization in Distributed Databases, February 1983

Chandru, Vijaya –  Complexity of the Super-Group Approach to Integer Programming, September 1982

Chiu, Samuel S. –  Location Problems in the Presence of Queuing, February 1982

Kalish, Shlomo –  Control Variables in Models of Innovation Diffusion, June 1982

Sarkar, Debashish –  Energy Economics and Optimization: A Synthesis, February 1982

Roth, Emily J. –  An Investigation of the Transient Behavior of Stationary Queuing Systems, June 1981

Valor-Sabatier, Josep –  Diagnostic Analysis of Inventory Systems, June 1981

Sadiq, Ghazala –  Facility Location Problems in Spaces with Discontinuities in the Travel Medium, June 1981

Sempolinski, Dorothy –  Inverse Optimization Applied to Fixed Charge Models, February 1981

Yanasse, Horacio H. –  Aggregation and Computational Complexity of Lot Size Problems, September 1981

Livne, Zvi A. –  The Role of Time in Negotiations, September 1979.

Berman, Oded –  Dynamic Positioning of Mobile Servers on Networks, February 1978.

Modiano, Eduardo M. –  Normative Models for Optimal Seismic Design, June 1978.

Pariente, Silvia –  Mathematical Programming Approaches to Modeling Technological Change, with Applications to the Energy Sector, June 1978.

Shepardson, Wilfred B. –  A Lagrangean Relaxation Algorithm for the Two Duty Period Scheduling Problem, June 1978.

Bloom, Jeremy A. –  A Mathematical Model of Fuel Distribution in New England, September 1978.

Eriksen, Steven E. –  Policy Oriented Multi-Equation Models of U.S. Domestic Air Passenger Markets, September 1977.

Bitran, Gabriel R. –  Admissible Points and Vector Optimization: A Unified Approach, February 1975.

Cretin, Shan A. –  A Model of the Risk of Death from Myocardial Infarction, February 1975.

Mirchandani, Pitu B. –  Analysis of Stochastic Networks in Emergency Service Systems, February 1975.

Hauser, John R. –  A Normative Methodology for Predicting Consumer Response to Design Decisions: Issues, Models, Theory and Use, June 1975.

Boyle, Brian Edward –  Computer-Aided Therapeutic Diagnosis, June, 1974.

Handler, Gabriel Y. –  Minimax Network Location: Theory and Algorithms, September, 1974

Bell, David –  The Resolution of Duality Gaps in Discrete Optimization, September 1973.

Mehta, Cyrus –  Multi period Adaptive Control of the Wellhead Price of Natural Gas: A Bayesian Decision Theoretic Approach, September 1973.

Rousseau, Jean-Marc –  A Cutting Plane Method for the Fixed Cost Problem, September 1973.

Oliver, Robert M. –  The Design and Error Analysis of a Production and Inventory Control System, June, 1957.

Little, John D.C. –  Use of Storage Water in a Hydroelectric System, February 1955.

Jiang, Qingxuan  Choice Modeling and Assortment Optimization on the Transformer Model, February 2024

Robin, Arnaud  Robust Inventory Induction under Demand Uncertainty, February 2024

Angevine, Kathryn  Multi-Modal Transit Time Prediction for E-Commerce Fulfillment Optimization and Carbon Emissions Reduction, June 2023

Benbaki, Riade  Topics in Sparsity and Compression: From High dimensional statistics to Overparametrized Neural Networks, June 2023

Luciano Rivera , Gianpaolo Data-driven Clustering for New Garment Forecasting, June 2023

Ramé, Martin  Branch-and-Price for Prescriptive Contagion Analytics, June 2023

Reubenstein, Rebecca  Equitable Community Health Worker Deployment in sub-Saharan Africa: A Modeling Framework for Stochastic Health Progression, June 2023

Siegel, Benjamin M.  Innovative Supply Chain Cyber Risk Analytics: Unsupervised Clustering and Reinforcement Learning Approaches, June 2023

Blanks, Lindsey  Operational Scheduling of Deep Space Radars for Resident Space Object Surveillance, May 2022

Groszman, Kenny  Sequential Optimization for Prospective Patient Segmentation and Content Targeting, May 2022

Guinet, Gauthier Marc Benoit  Bandit Problems under Censored Feedback​, September 2022

Humphries, Samuel S.  Analytics for Sustainable Logistics: Fuel Efficiency and Hydrogen Planning, May 2022

Niu, Yumeng  Optimal Targeting under Gender Fairness, May 2022

Slavov, Stanislav  Causal Inference: Heterogeneous Effects and Non-stationary Environments, May 2022

Wyler, Paige  Developing a Decision-Making Framework for Carbon: Incorporating Carbon into Optimized Business Objectives, May 2022

Escribe, Célia  Reducing Physician Burnout and Costs in Outpatient Healthcare Settings via Advanced Analytics, June 2021.

Georgescu, Andreea  Inventory Positioning in Modern Retail, February 2021.

Halem, Zachery M.  Financing Fusion Energy, June 2021.

Kaw, Neal  Preventing Opioid Overdose: From Prediction to Operationalization, June 2021.

Kendall, Thomas P.  Optimizing Weapon Precision, June 2021.

Killian, Daniel T.  Operational Innovations to Improve Malawi’s HIV Sample Transportation Network, June 2021.

Koch, Matthew  Air Force Crew Scheduling: An Integer Optimization Approach, June 2021.

Yuan, Matthew  An EM algorithm for Lidar deconvolution, June 2021.

Burnham, Katherine Lee  Information Fusion for an Unmanned Underwater Vehicle through Probabilistic Prediction and Optimal Matching, June 2020.

Dan, Or  Improving Prior Knowledge Assessment in Process Characterization, June 2020.

Dimaki, Georgia  Dynamic Node Clustering in Hierarchical Optical Data Center Network Architectures, September 2020.

Emschwiller, Matt V.  Understanding Neural Network Sample Complexity and Interpretable Convergence-guaranteed Deep Learning with Polynomial Regression, June 2020.

Graham, Justin W.  School Choice: A Discrete Optimization Approach, June 2020.

Liu, Jessamyn  Anomaly Detection Methods for Detecting Cyber Attacks in Industrial Control Systems, September 2020.

Lukin, Galit  Prescriptive Methods for Adaptive Learning, June 2020.

McIntyre, Colin Alex  Optimizing Inbound Freight Mode Decisions, June 2020.

Poullet, Julie  Leveraging Machine Learning to Solve the Vehicle Routing Problem with Time Windows, June 2020.

Blanks, Zachary D . A Generalized Hierarchical Approach for Data Labeling, June 2019.

Guenon des Mesnards, Nicolas  Identifying and Assessing Coordinated Influence Campaigns on Social Networks, June 2019.

Thomas, Merin  Intelligent Supplies Replenishment Process, June 2019.

Zhang, Rebecca  Interpretable Machine Learning Methods for Stroke Prediction, September 2019.

Zhu, Jessica H.  Detecting Food Safety Risks and Human Trafficking Using Interpretable Machine Learning Methods, June 2019.

Dedieu, Antoine  Sparse learning: Statistical and Optimization perspectives, June 2018.

Furtado, Jazmin D.  Applications of Healthcare Analytics in Reducing Hospitalization Days, June 2018.

Herrling, Austin Donald  Optimization of Micro-Coaxial Wire Routing in Complex Microelectronic Systems, June 2018.

Xu, Sharon  Modeling Human Dynamics and Lifestyles using Digital Traces, June 2018.

Vanden Berg, Andrew M.  Optimization-Simulation Framework to Optimize Hospital Bed Allocation in Academic Medical Centers, September 2018.

Anoun, Amine  A Data-Driven Approach to Mitigate Risk in Global Food Supply Chains, June 2017.

Candela Garza, Eduardo  Revenue Optimization for a Hotel Property with Different Market Segments: Demand Prediction, Price Selection and Capacity Allocation, September 2017.

Mariadassou, Shwetha Paramananda  Relative Performance Transparency: Effects on Sustainable Purchase and Consumption Behavior, June 2017.

Morse, Steven T.  Persistent Cascades and the Structure of Influence in a Communication Network, June 2017.

Scully, Timothy  Redesigning Liver Allocation Regions through Optimization, June 2017.

Webb, Matthew Robert  Inferring User Location from Time Series of Social Media Activity, June 2017.

Lee, Peter Alexander  Think Global, Act Local When Estimating a Sparse Precision Matrix, June 2016.

Mundell, Lee Carter  Predicting Performance Using Galvanic Skin Response, June 2016.

Rajagopalan, Krishnan  Interacting with Users in Social Networks: The Follow-back Problem, June 2016.

Saroufim, Carl Elie  Internet of Things and Anomaly Detection for the Iron Ore Mining Industry, June 2016.

Saunders, Zachary Clayton  Multi-target Tracking via Mixed Integer Optimization, June 2016.

Borjian Boroujeni, Setareh  Optimization of Yard Operations in Maritime Container Terminals, June 2015.

Hanley, Zebulon James  Delay Characterization and Prediction in Major U.S. Airline Networks, June 2015.

Harris, William Ray  Anomaly Detection Methods for Unmanned Underwater Vehicle Performance Data, June 2015.

Lepird, John R.  Multi-Objective Optimization of Next-Generation Aircraft Collision Avoidance Software, June 2015.

Rhee, Donguk  Faster Fully Polynomial Approximation Schemes for Knapsack Problems, June 2015.

Rizzo, Ludovica  Price Incentives for Online Retailers using Social Media Data, June 2015.

Rossillon, Kevin Joseph  Optimized Air Asset Scheduling Within a Joint Aerospace Operations Center (JAOC), June 2015.

Schonfeld, Daniel  Dynamic Prediction of Terminal-Area Severe Convective Weather Penetration, June 2015.

Sheth, Mallory  Predicting Mortality for Patients in Critical Care: a Univariate Flagging Approach, June 2015.

Testa, Mariapaola  Modeling and Design of Material Recovery Facilities: Genetic Algorithm Approach, June 2015.

Epstein, Christina  An Analytics Approach to Hypertension Treatment, June 2014.

Fast, Shannon M.  Pandemic Panic: A Network-based Approach to Predicting Social Response During a Disease Outbreak, June 2014.

Jernigan, Nicholas R.  Multi-modal, Multi-period, Multi-commodity Transportation: Models and Algorithms, June 2014.

Kim, Louis Y.  Estimating Network Structure and Propagation Dynamics for an Infectious Disease: Towards Eective Vaccine Allocation, June 2014.

Paynter, Jonathan L.  Optimized Border Interdiction, June 2014.

Sahyoun, Alexandre Paul  Application of Aircraft Sequencing to Minimize Departure Delays at a Busy Airport, June 2014.

Williams, Mark J  Column Generation Approaches to the Military Airlift Scheduling Problem, June 2014.

Bunting, Zachary S.  Improving Performance through Topology Management and Wireless Scheduling in Military Multi-hop Radio Networks, June 2013.

Culver, David M.    Robust Reconnaissance Asset Planning Under Uncertainty, June 2013.

Frost, Emily Anne   Robust Planning for Unmanned Underwater Vehicles, June 2013.

Kessler, John M   United States Air Force Fighter Jet Maintenance Models: Eectiveness of Index Policies, June 2013.

Lepage, Pierre-Olivier  Performance of Multiple Cabin Optimization Methods in Airline Revenue Management, June 2013.

Relyea, Stephen L.   An Analytics Approach to Designing Clinical Trials for Cancer, June 2013.

Robinson, Eric John  Coordinated Planning of Air and Space Assets: An Optimization and Learning Based Approach, June 2013.

Bradwick, Matthew E.    Belief Propagation Analysis in Two-Player Games for Peer-Influence Social Networks, June 2012.

Crimmel, Brian A.    A Priori and On-line Route Optimization for Unmanned Underwater Vehicles, June 2012.

Evans, Jane A.    Modeling Social Response to the Spread of an Infectious Disease, June 2012.

Parandehgheibi, Marzieh  Survivable Paths in Multilayer Networks, June 2012.

Wang, Hai   Approximating the Performance of a Last Mile Transportation System, June 2012.

Cates, Jacob Roy    Route Optimization Under Uncertainty for Unmanned Underwater Vehicles, June 2011.

Cho, Philip Y.    Optimal Scheduling of Fighter Aircraft Maintenance, June 2011.

Howard, Nicholas J.    Finding Optimal Strategies for Influencing Social Networks in Two Player Games, June 2011.

Boyer, Christopher A.    Statistical Methods for Forecasting and Estimating Passenger Willingness-to-Pay in Airline Revenue Management, June 2010.

Chaiwanon, Wongsakornt    Capacity Planning and Admission Control Policies for Intensive Care Units, September 2010.

Chiraphadhanakul, Virot    Routing and Scheduling Models for Robust Allocation of Slack, June 2010.

Diwan, Sarvee    Performance of Dynamic Programming Methods in Airline Revenue Management, June 2010.

Frumin, Michael S    Automatic Data for Applied Railway Management: Passenger Demand, Service Quality Measurement, and Tactical Planning on the London Overground Network, June 2010.

Gupta, Shubham    Transient Analysis of D(t)/M(t)/1 Queuing System with Applications to Computing Airport Delays, June 2010.

Herold, Thomas Michael    Asynchronous, Distributed Optimization for the Coordinated Planning of Air and Space Assets, June 2010.

Hung, Benjamin W. K.    Optimization-Based Selection of Influential Agents in a Rural Afghan Social Network, June 2010.

Rajagopalan, Shreevatsa   Distributed Averaging in Dynamic Networks, September 2010.

Seidel, Scott B.    Planning Combat Outposts to Maximize Population Security, June 2010.

Shenk, Kimberly N.    Patterns of Heart Attacks, June 2010.

Snyder, Ashley M.    Data Mining and Visualization: Real Time Predictions and Pattern Discovery in Hospital Emergency Rooms and Immigration Data, June 2010.

Vaze, Vikrant    Calibration of Dynamic Traffic Assignment Models with Point-to-Point Traffic Surveillance, June 2010.

Yang, Lang    Modeling Preferences for Innovative Modes and Services: A Case Study in Lisbon, June 2010.

Marks, Christopher E.  – Optimization-Based Routing and Scheduling of IED-Detection Assets in Contemporary Military Operations, June 2009.

Negron, Blair Ellen Leake  – Operational Planning for Multiple Heterogeneous Unmanned Aerial Vehicles in Three Dimensions, June 2009.

Sasanuma, Katsunobu  – Policies for Parking Pricing Derived from a Queueing Perspective, September 2009.

Soldner, Mallory Jo  – Passenger-Centric Ground Holding: Including Connections in Ground Delay Program Decisions, June 2009.

Flietstra, Bryan C.  – A Data Mining Approach for Acoustic Diagnosis of Cardiopulmonary Disease, June 2008.

Foreman, John William  – Optimized Supply Routing at Dell Under Non-Stationary Demand, June 2008.

Gaudet, Megan  – Harmonization of Aviation User Charges in the North Atlantic Airspace, June 2008.

Guo, Jingqiang Charles  – Estimation of Sell-up Potential in Airline Revenue Management Systems, June 2008.

Le Guen, Thibault  – Data-driven pricing, September 2008.

Limpaitoon, Tanachai  – Real-time Multi-Period Truckload Routing Problems, February 2008.

Murphy, Maurice D.  – Tropical Cyclone Preparedness and Response: Opportunities for Operations Research, June 2008.

Noyes, Clay W.  – Analysis and Optimization of the Emergency Department at Beth Israel Deaconess Medical Center via Simulation, June 2008.

Quinteros, Martin  – Managing Portfolios of Products and Securities, September 2008.

Siow, Christopher  – Analysis of Batching Strategies for Multi-Item, February 2008.

Ye, Yunqing  – Joint Pricing and Inventory Decision for Competitive Products, February 2008.

Bryant, Corban Harrell  – Robust Planning for Effects-Based Operations, June 2006.

Guo, Kenrick  – Examining Financial Puzzles From An Evolutionary Perspective, February 2006.

Hanowsky, Michael  – A Tool to Support the Planning of Ground Delay Programs Subject to Uncertain Arrival Capacities, June 2006.

McAllister, Daniel B.  – Planning with Imperfect Information: Interceptor Assignment, June 2006.

Sakamoto, Philemon  – UAV Mission Planning Under Uncertainty, June 2006.

Shah, Premal  – No-arbitrage Bounds on American Put Options with Single Maturity, June 2006.

Zhou, Xinfeng  – Application of Robust Statistics to Asset Allocation Models, June 2006.

Chandler, Lincoln J . – A Decision Analytic Approach to Web-Based Clinician Training, February 2005.

Hickman, Randal E.  – Interception Algorithm for Autonomous Vehicles with Imperfect Information, June 2005.

Malasky, Jeremy S.  – Human Machine Collaborative Decision Making in a Complex Optimization System, June 2005.

Mostagir, Mohamed – Fully Polynomial Time Approximation Schemes for Sequential Decision Problems, September 2005.

Tardy, Raphaël  – Optimization Models and Algorithms for Large-Scale, Capacity Constrained Pick-up and Delivery Problems with Time WIndows, June 2005.

Weber,Theophane  – Conditional Dynamics of Non-Markovian, Infinite-Server Queues, June 2005.

Wroten, Matthew C.  -Coordinated Dynamic Planning for Air and Space Operations, June 2005.

Yamanaka, Shiro  -The Impact of Infrastructure-Related Taxes and Fees on Airline Fares in the US and the European Union, June 2005.

Agbokou, Biova  – Robust Airline Schedule Planning: Review and Development of Optimization Approaches, June 2004.

Alighanbari, Mehdi  – Task Assignment Algorithms for Teams of UAVs in Dynamic Environments, June 2004.

Jeffreys, Christopher G.  – Support Vector Machine and Parametric Wavelet-Based Texture Classification of Stem Cell Images, June 2004.

Key, Jonathan Ramsay  – Routing in Probabilistic Networks, June 2004.

Koepke, Corbin G.  – Multi-Mission Optimized Re-Planning in Air Mobility Command’s Channel Route Execution, June 2004.

Sarmadi, Sepehr  – Minimizing Airline Passenger Delay through Integrated Flight Scheduling and Aircraft Routing, June 2004.

Tanizar, Ketty  – Alternatives to the Gradient in Optimal Transfer Line Buffer Allocation, September 2004.

Timmers, Kendell M.  – Learning Together Better: The Structured Design of Learning Teams, June 2004.

Varol, Nebibe  – Inventory Deployment and Market Area Segmentation in a Two-Echelon Distribution Network Design, June 2004.

Ergun, Ayla  Optimal Scheduling of Radiotheraphy and Angiogenic Inhibitors, February 2003.

Seyhan, Murat  Private Risk and an Example From the Pharmaceutical Industry, February 2003.

El Alj, Yasmine  Estimating the True Extent of Air Traffic Delays, June 2003.

Mao, Ye  A Profit Maximization Model in a Two-Echelon Supply Chain Management: Distribution and Pricing Strategies, June 2003.

Phomma, Maxime  Product Development Collaboration Between Original Equipment Manufacturers and After Market Suppliers, June 2003.

Xu, Ping  Approximate Expected Delay for a Nonstationary Queue and an Application to Air Traffic Control, June 2003.

Zarybnisky, Eric J.  Allocation of Air Resources Against an Intelligent Adversary, June 2003.

Yee, Michael  Solving Network Equilibrium Problems in Static and Dynamic Environments, September 2003.

Amonlirdviman, Kevin   The Dynamics of Global Financial Crises, June 2002. 

Bart, Yakov Y.  Determinants and Consequences of Trust in Online Environment, September 2002.

Kang, Seong-Cheol  Algorithms for Routing Problems in Stochastic Time-Dependent Networks,  June 2002. 

Nielsen, Christopher A.  Large-Scale Network Design using Composite Variables:An Application to Air Mobility Command’s 30-day Channel Route Network, June 2002. 

Schorr, Raphael Avram  On the Explanatory Value of Condition Numbers for Convex Optimization: Theoretical Issues and Computational Experience, September 2002. 

Shioda, Romy  Restaurant Revenue Management, June 2002.

Achy-Brou, Aristide C.E.  A New Approach to Multistage Serial Inventory Systems, February 2001. 

Barth, Christopher   Composite Mission Variable Formulation For Real-Time Mission Planning, June, 2001. 

Chandra, Anurag  Algorithms for Locomotive Scheduling, February 2001. 

Clark, Steven J.  Large-Scale Optimization Planning Methods for Distribution and Transportation. Logistics: An Application to Contingency Munitions, June, 2001. 

Duran Murrieta, Rodolfo  Effects of Supply Chain Strategy in Distribution Networks, February 2001. 

Idris, Husni Rifat  Queuing Dynamics and Control of Departure Operations at Boston Logan Airport, February 2001. 

Jang, Young Jae   Multiple Part Type Decompostion Method in Manufacturing Processing Line, June, 2001. 

Moffitt II, Jeffrey D.  Applying the Metrics Thermostat to Naval Acquisitions for Improving the Total Ownership Cost-Effectiveness of News Sytems, June, 2001. 

Theatte, Kermit  Tactical Shipping and Scheduling at Polaroid with Dual Lead Times, June, 2001. 

Toubia, Olivier  Interior-Point Methods Applied to Internet Conjoint Analysis, February 2001. 

Werner,Loren M.  Analysis and Design of Closed Loop Manufacturing Systems, September, 2001.

Andersson, Kari    Potential Benefits of Information Sharing During the Arrival Process at Hub Airports, June 2000. 

Cohen, Jonathan E. W.  Safety at What Price?: Setting Anti-terrorist Policies for Checked Luggage on US Domestic Aircraft, June 2000. 

Coumeri, Marc H.   Dynamic Pricing in a Competitive Environment: A Learning Approach September 2000. 

Gzouli, Omar  Comparison of Scheduling Policies by Simulation, June 2000. 

Kachani, Soulaymane  Analytical Dynamic Traffic Flow Models: Formulation, Analysis and Solution Algorithms, February 2000. 

McKeever, Scott D.  Path Planning for an Autonomous Vehicle, June 2000. 

Messmacher, Eduardo B.  Models for Project Management, June 2000. 

Muharremoglu, Alp  The Aircraft Sequencing Problem with Arrivals and Departures, February 2000. 

Sursock, Jean-Paul  The Cross Section of Expected Stock Returns Revisited, June 2000.

Bratu, Stephane  Network Value Concept in Airline Revenue Management, February 1999.   Lee, Pei Ting  Dynamic Programming Model for Mortgage Refinancing Problem with Stochastic Interest Rates, June 1999. 

Lohatepanont, Manoj  Incremental Airline Schedule Design, February 1999. 

Marandon, Eric  The Hermite Black-Scholes Formula: Relating Option Prices to Moments of the Underlying Asset, June 1999. 

Taneja, Hemant  A Tactical Planning Model for a Semiconductor Wafer Fabrication Facility, June 1999. 

Tziligakis, Constantine N. Relaxation and Exact Algorithms for Solving Mixed Integer-Quadratic Optimization, September 1999. 

Wike, Carl E.  Supply Chain Optimization: Formulations and Algorithms, February 1999.

Al-kibsi, Gassan Ahmed  Optimal Product Assortment for Consumer Packaged Goods Retailers, June 1998. 

Cervantes, Jose A.  Effective Modeling of Throughput in Semiconductor Assembly Processes, February 1998. 

Chew, Elaine  Multiperiod Portfolio Optimization: Feynman Diagrams and Approximate Dynamic Programming, June 1998. 

Coop, Andrew E.  Contingency Munitions Logistics Planning and Control: A Framework for Analysis, June 1998. 

Kassab, Hisham I.  Scheduling in Packet Radio Networks, June 1998. 

Krishnan, Niranjan  Design of Large Scale Transportation Service Networks with Consolidation: Models, Algorithms and Applications, February 1998. 

Lauprette, Geoffrey J.  Some Aspects of the Optimal Grouping of Stocks, February 1998. 

Liu, Wenyun  Winning the Competitive Edge in the DRAM Market: A System Dynamics Analysis, February 1998. 

Ouyang, Li  An On-line Shopping Study, June 1998. 

Rifkin, Ryan M.  The Single Airport Static Stochastic Ground Holding Problem, June 1998.

  Shanbhag, Vinayak V.  Optimal Control Systems in Response to Diverse Electricty Pricing Structures, February 1998. 

Tan, Too-Ping  Extensions of the Minimum Cut Problem and Their Applications in Airfield Cutting, February 1998.

Bowman, Jeremy M.  Analysis and Optimization of a Biotechnology Service Operation, June 1997. 

Clarke, Michael Dudley Delano  An Introduction to the Airline Recovery Problem, June 1997. 

Guastalla, Guglielmo  An Advanced Algorithm for Air Traffic Flow Management, June 1997. 

Liao, Te-San  Modeling and Cost Analysis of Global Logistics and Manufacturing System, June 1997. 

Nemec, Joseph Edward  A Quantity Scheduling Language for Manufacturing Systems, June 1997. 

O’Dell, Susan W.  Optimal Control Strategies for a Rail Transit Line, June 1997. 

Sheel, Minakshi  Probabilistic Analysis of Ground-Holding Strategies, February 1997.

Chopra, Sameer  Efficient Scenario Evaluations Using the Nested Logit Model, June 1996. 

Choy, Brenda P-T.  Analyzing Total Distance in Vehicle Routing Problems, June 1996.

D’Amato, Rebecca M.  Allocating Housing Resources for a Psychiatric Program, June 1996.

Escobar Fernandez de la Vega, Marcos  Systematic Procedure to Meet Specific Input/Output Constraints in the l1-optimal Control Problem Design, June 1996. 

Ma, Chien  Models and Algorithms for a Stochastic One Machine Sequencing Problem, June 1996. 

Sylla, Abdoul K.  Portfolio Optimization Using Non-Gaussian Return Distributions, June 1996. 

Wang, I-Lin  Implementing the Premultiplier Method for Minimum-Cost Flow Problem, February 1996. 

Willems, Sean P.  Strategic Safety Stock Placement in Integrated Production/Distribution Systems, June 1996. 

Young, Janice M.  Decoding of a Markov Process with Imperfect State Information, June 1996.

Al-Othman, Abdulwahab N.  Analysis of Vaidya’s Volumetric Cutting Plane Algorithm, September 1995. 

Armacost, Andrew P.  Modeling Railroad Terminal Operations: Supporting Real-Time Network Planning and Control, June 1995. 

Chiu, Kenneth  Generalized Gaussian Covariance Analysis in Multi-Market Risk Assessment, February 1995. 

Chu, Michael Yi Xin  Combining Heuristics and Integer Programming for Optimizing Job Shop Scheduling Models, February 1995. 

Fournier, Renaud R.  Analyzing Scanner Data for Manufacturing Planning, June 1995. 

Giancola, Augusto Rafael Some Tools for Event Frequency Decomposition and Heterogeneous Transfer Line Analysis, June 1995. 

Kostiner, Barry J.  Spatial Market Equilibrium for Resistive Electric Networks, February 1995. 

Lakshmi, Viswanathan  Genetic Algorithms for Uncapacitated Network Design, February 1995. 

Lee, Fung-Man  Studies in Time Series Analysis and Forecasting of Energy Data ,June 1995. 

Merrill, N’Gai  A Multi-Period General Equilibrium Model of Long-Term Environmental Policy Using Overlapping Generations, June 1995. 

Mori, Yutaka  Demand for Interactive Television, February 1995. 

Reiss, Stan  Message Routing in Level 1 of the Wide-Band All-Optical Network ,June 1995. 

Ying, Yee-Chien Calvin  How Can Improved Weather Forecasting Accuracy Reduce Air Traffic Delays?, September 1995.

Ahn, Sungsu  Construction and Implementation of Real-Time Scheduling Algorithms in a Computer Aided Fabrication Environment, February 1994. 

Ansari, Mohsinuddin  A Queueing Analysis of a Buffered Block-Selective S-ARQ Protocol, June 1994. 

Brodsky, Valery  Optimization Methods for Topological Design of Interconnected Ring Networks, February 1994. 

Chu, Qin  A Dynamic and Stochastic Model for Distribution of Empty Containers, June 1994.

Chu, Ronald W.Y.  Finding a Cycle with Maximum Profit-to-Time Ration – An Application to Optimum Deployment of Containerships, June 1994. 

Datta, Sougata  CEPH Fingerprints and Their Analysis, June 1994. 

Fang, Yue  A Sequential Approach for Estimating Two-factor Interactions, June 1994.

  Gopalakrishnan, Srimathy  Optimization Models for Production Planning in Metal Sheet Manufacturing, February 1994. 

Hauksson, Arni G.  Management of the Marketing Mix, Using Models Based on Household Level Data, February 1994. 

Hocker, Guy A.  Airport Demand and Capacity Modeling for Flow Management Analysis, February 1994. 

Humair, Salal  An Approach to Solving Constraint Satisfaction Problems Using Asynchronous Teams of Autonomous Agents, September 1994. 

Kaufman, Alan  Data and Algorithms for Genomic Physical Mapping, September 1994. 

Kuo, Yu-Ting  Some Estimates of the Value of Software, June 1994. 

Maragos, Spyridon A.  Revenue Management for Ocean Carriers: Optimal Capacity Allocation with Multiple Nested Freight Rate Classes, June 1994. 

Murti, Kamala P.  Static and Dynamic Scheduling in a Two Station Mixed Queuing Network, June 1994. 

Stamatopoulos, Miltiadis A.  A Factory Representation as a Design Tool in a Computer Integrated Manufacturing Environment, June 1994. 

Voigtlaender, Christian H.  Intermodal Freight Transportation – An Integrated Analysis of Strategy and Operations, June 1994. 

Zilberman, Yaron  The Asset Allocator, February 1994.

Burman, Mitchell H.  A Real-Time Dispatch Policy for a System Subject to Sequence-Dependent, Random Setup Times, February 1993. 

Duarte, Maria Cristina  Multiple Product Cycle Time Minimization for Serial Placement Machines, September 1993.

Goranson, Jesse  Looking for Trouble: How Well the FAA’s Enhanced Traffic Management System Predicts Aircraft Congestion, September 1993. 

Jeancard, Henri-Pierre  Forecasting Capabilities and Model Diagnostics for Auto-Regressive Conditionally Heteroskedastic Time Series, February 1993.

  López-Arteaga, Alfonso J.  The Dynamic Traffic Assignment Problem in Intelligent Vehicle – Highway Systems, February 1993. 

Malone, Kerry M.  Modeling a Network of Queues Under Nonstationary and Stochastic Conditions, February 1993. 

Mueller, Alexander T.  Optimizing Advertisement Selections and Scheduling, February 1993. 

Pinker, Edieal J.  Computational Experience with a New Workforce-Workflow Scheduling Model, February 1993. 

Rajan, Kavitha  Analysis Of Heuristics For The Hierarchical Network Design Problem, June 1993. 

Shumsky, Robert A.  The Response of the U.S. Air Carriers to the DOT’s On-Time Disclosure Rule, June 1993. 

Theodosopoulos, Theodore V.  Worst-Case Identification in l1: Algorithms and Complexity, February 1993. 

Thomke, Stefan H.  Multivariate Quality Control of Flexible Manufacturing Processes, February 1993. 

Vanderbeck, Francois  A Decomposition Approach for Parallel Machine Assignment and Setup Minimization in Electronics Assembly, February 1993. 

Vettas, Lt. Peter C.  Cost and Productibility Optimization of Naval Ship Midship Section, June 1993. 

Zaman, Zia  A Scheduling Package Based on the QIE, February 1993.

Connolly, Stephanie  A Real-Time Policy for Performing Setup Changes in a Manufacturing System, June 1992. 

Elsesser, Kim  The Validation of a Simulation Model for the Allocation of Mental Health Services February 1992. 

Hsu, Lina Y.  The Design of an Assembly Line with Stochastic Task Times, June 1992. 

Longtin, Mark  Sequential Screening in Semiconductor Manufacturing: Exploiting Spatial Dependence, June 1992. 

Misra, Dipanwita (Diane)  Compression and Retrieval of Network Routing Solutions, June 1992. 

Park, Jai-Kue  Consumer Choice Modeling in the Presence of Brand Extension, September 1992. 

Ricard, Michael  A Decomposition Approach to Zero-One Integer Programming, February 1992. 

Robinson, Jonathan D.  A Simulation Testbed for Flow Management in Air Traffic Control, September 1992. 

Stanley, Timothy D.  The Economic Status of American Causalities of the Vietnam War, June 1992. 

Vives, Guillaume-Yves  Real-Time Scheduling of an Assembly Stage in a Production Line, February 1992. 

Vyas, Mary Pressley  Specification of Gaussian Process Models for Asset Returns with Asynchronous or Missing Data, June 1992.

Anderson, Susan M. L.  On Queue Audience: Calculating Reach and Frequency for Supermarket Television, June 1991. 

Baldi, Martha A.   An Analysis of Quality Control Policies on a Two-Station M/M/1 Production System, June 1991. 

Bucciarelli, Mark   Cluster Sampling Methods for Monitoring Route-Level Transit Ridership, September 1991. 

Chen, Meng-Huai   How Much Cash Should A Bank Maintain? – An Optimization Approach, September 1991. 

Chi, Zhihang   An Adaptive Final Approach Spacing Advisory System: Modeling, Analysis and Simulation, June 1991. 

Ingolfsson, Armann   Run by Run Process Control, September 1991. 

Miller, Jennifer A.  Spatial Interpretation and Statistical Modeling of Boston High School Dropouts, June 1991. 

Milner, Joseph M.  The Assembly Sequence Selection Problem: An Application of Simulated Annealing, June 1991. 

Savari, Serap   Source Coding for Channels with Finite-State Letter Costs, September 1991. 

Schenler, Warren  Robustness Under Uncertainty: A Normative Reduction of Multi-Future,  Multi-Attribute Tradeoffs in Electric Utility Planning, February 1991. 

Svrcek, Tom   Modeling Airline Group Passenger Demand for Revenue Optimization, June 1991 

Vranas, Peter B.   Merchant Fleet Size versus External Trade and Other Relevant Variables: A Statistical Investigation, June 1991. 

Yoshimura, Junichi  Improved Service and Maintenance Through Accident Sequence Precursor Risk Analysis, June 1991.

Abundo, Stephanie F.  An Approach for Estimating Delays at a Busy Airport, June 1990. 

Chervi, Philippe  A Computational Approach to Probabilistic Vehicle Routing Problems, February 1990. 

Generazio, Hoa  Analysis of First-Term Attrition of Non-Prior Service High-Quality U.S. Army Male Recruits, February 1990. 

Horangic, Basil R.  Some Queueing Models of Airport Delays, February 1990. 

Jacobe de Haut de Sigy, Romuald   Loading Control Policy for a Batch Machine, February 1990. 

Kierszenbaum, Michael   The Impact of Inspection Delays on Quality Contro,l June 1990. 

Kurebayashi, Atsushi  Comparison of Flow Shop Sequencing Models and Methods, June 1990. 

Lemire, Linda Jill   Due-Date Setting and Pricing in a M/M/1 First-Come First-Served Queue, June 1990. 

Ramakrishnan, V. S.  A LaGrange Multiplier Method for Solving Multi-Objective Linear Programs, September 1990. 

Vieira, Luiz F. M.  Computational Tests of Interior Point Algorithms for Linear Programming, June 1990.

Alston, Andrew  – An Integrated System for Tracking of Landmarks on Video Data: TOMAS the Torsional Ocular Movement Analysis System, June 1989

Amblard, Guillaume P. –  Rationale for the Use of Subassemblies in Production Systems: A Comparative Look at Sequential and Arborescent Systems, June 1989

Ballman, Karla V. –  Screening U.S. Donated Blood for HIV, February 1989

Bespolka, Carl G. –  A Framework for Multiple Attribute Evaluation in Electric Utility Planning, June 1989

Caulkins, Jonathan –  Inventory And The Strategic Value of Product-Flexible Manufacturing Systems, February 1989

Dickey, Lynn –  Where Should Safety Stock Be Held to Minimize Costs and Maximize Flexibility, June 1989

Fouska, Nikoletta –  Optimal Location of Discretional Service Facilities on a Network, June 1989

Fujiwara, Tsuneo –  Solving the Schedule Transition Problems Using Optimization Techniques, June 1989

Ingco, Divinagracia I. –  Network Design Problems for Improving Facility Locations, June 1989

Lin Carrie –  Analysis of Open Loop Manufacturing Systems, February 1989

Pappu, Suguna –  A Dual-Ascent Algorithm for Finding an Assembly Test Strategy, September 1989

Schreibman, Ruth –  Structural-Equation Modeling of the Sources of Market Pioneer Advantages: an Empirical Analysis of the Consumer Goods Industry, June 1989

Valdivieso, Teresa –  Discrete Choice Analysis of Demand for Optional Telephone Calling Features, February 1989

Venkatakrishnan, C.S. –  Sentencing Changes and Prison Population: The Transient Effects, February 1989

Badekas, Paris –  Mathematical Modeling of En route of ATC Intervention Rates, June 1988

Berger, llana –  Shipping Strategies in Multi modal Networks Exhibiting Economies, June 1988

Loiederman, Eric –  A Planning Tool for Predicting En Route ATC Conflicts and Designing ATC Sectors, September 1988

Louvet-Boutant, Anne-Claire –  The Bounded Rationality Constraint: Experimental and Analytical Results, June 1988

Mihara, Shoichiro –  A Tactical Model for a Job Shop with Unreliable Work Stations and Capacity Constraints, February 1988

Polychronopoulos, George –  Solution of Some Problems in Decentralized Detection by a Large Number of Sensors, June 1988

Sabanogulu Kohen, Jinet  – The Economics of Product Design: A Model and An Application, June 1988

Saias, Isaac I.  – Study of Probabilistic Noise in One Dimensional Images, June 1988

Srinivasan, K.V. (Cheena)  – Effect of Consumer Categorization Behavior on New Product Sales Forecasting, June 1988

Sy-Quia, lll, Gonzalo  – A Study of Production Loading in a Job Shop, September 1988

Aslidis, Anastasios Haralampos –  Management of Technological Change in the Shipbuilding Industry: A Learning Curve Approach, June 1987

Bertsimas, Dimitris –  An Analytic Approach to a General Class of G/G/s Queuing Systems, February, 1987

Chan, Ga-Yin (Leo)  – INGRID: An Interactive Color Graphics Interface for Dispatch of Emergency Vehicles, June 1987

Emami, Kayvan –  An Investigation of Time Dependent Queues with Priorities, September 1987

Emami, Neda –  Analysis of Duality Constructions for Variable Dimension Fixed Point Algorithms, September 1987

Higgins, Mary-Kay –  Airline Safety: A Comparative Analysis, February 1987

Lee, Anthony –  Nested Decomposition Methods for Vehicle Routing and Scheduling, June 1987

Parrish, Scott H. –  Extensions to a Model for Tactical Planning in a job Shop Environment, June 1987

Redfield, Carol Holmes –  Equipment Selection and Task Assignment for Multi product Assembly System Design, February, 1987

Shell, Martin C. –  Decision Horizons in Multi-Stage Optimization Models: An Analysis of Methods for the Minimization of End-of-Horizon Errors, February, 1987

Berman, Douglas  – The Manned Space Station Power System: An Operational Scheduler, September 1986

Calamaro, Jean-Paul –  Implementation of a Multistage Production Planning Systems, February 1986

Cheatham, John –  Analyzing Service Industries with Applied Quantitative Methods, June 1986

Eckstein, Jonathan –  Routing Methods for Twin-Trailer Trucks, June 1986

Huelskamp, Robert M. –  Aiding USAF/UPT Aircrew Scheduling Using Network flow Models, June 1986

Kee, Jacqueline –  Dispatch Strategies for Some Unusual Bulk Service Queues, June 1986

Marge, Charles –  Explaining Optimal Solutions to Assignment and Transportation Problems, June 1986

Newton, Elizabeth A.C. –  A Clustering Method for Group Viral Samples Based on Antibody Binding Activity, June 1986

Parekh, Abhay K.J. –  Minimizing the Number of Clusters in Mobile Packet Radio Networks, February 1986

Schiodtz, Paul G. –  Competitive Price, Position, and Advertising Strategies, June 1986

Wagner, Janet M. –  Reliability of Water Distribution Systems, February 1986

Wan, Deborah –  Locating New Facilities on a Multi activity, Multi-level Network, June 1986

Chapman, Paul T. –  Optimal Production Capacity in a Two Stage Subject to Production Failure, February 1985

Cox, Jr. Louis A. –  Risk Attribution in the Presence of Joint Causes, February, 1985

Hiller, Randall –  Computer-Aided Planning: A Decision Support Concept for the Corporate Planning Domain, June 1985

Ho, Ping –  The Application of the Cross Impact Analysis to Technological Change, September 1985

Lee, I-Jen – Stationary Markovian Queuing Systems: An Approximation for the Transient Expected Queue Length, June 1985

Richetta, Romano –  Color Graphics for Interactive Optimization of the Hypercube Queuing Model, June 1985

Arcila Agudelo, Adriana –  A Model to Provide Transportation Services for the Elderly and Handicapped, June 1984

Chen, Gloria Hiu-Lai –  Information Theoretic Models of Preprocessors and Decision Aids, June 1984

Leong, Poh Leng –  Multi attribute Queuing Theory, June 1984

Singhal, Vijay M. –  Point-to-Point Package Delivery Systems, September 1984

Smith, Brian –  Coordinated Air Defense, June 1984

Brewster, Silvano –  Optimal Regulators Designed for Implementation on Computationally Limited Computers, February 1983

Magonet-Neray, Robin C. –  Optimal Ship Positions for Naval Battle Group Defense Problems, September 1983

Puente-Angulo, Carlos E. –  A Comparison of Linear and Nonlinear Random Field Estimators, June 1983

Roege, William –  Pilot Scheduling in a Fighter Squadron, February 1983

Tsai, Christopher L. –  Procurement Planning for Reusable Inventory Systems, September 1983

Bardenstein, Ruth –  Optimization of Water Resource Projects with Renewable Resources and Multiple Energy Production: The Mediterranean Sea Project to Produce Hydroelectric and Soar Power, June 1982

Josa, Charles – An Heuristic Decision Procedure for a Precedence Constrained Single-Depot Vehicle Routing Problem, February 1982

O’Rourke, Paul F. –  A Physically A Based Model of the Space conditioning Load Under Spot, February, 1982

Richardson, James –  Regulating Automobile Insurance Residual Markets: A Policy for Controlling the Size of the Pool in Selected Risk Classes, June 1982

Schaack, Christian –  Using the Kth Nearest Neighbor Clustering Procedure to Determine the Number of Subpopulations, June 1982

Ser, Shu –  Analysis of Automatic Vehicle Location Systems Operating in Systems, June 1982

Guillamon-Duch, Higinio –  The Economics of Low Temperature, Liquid-Dominated Hydrothermal Resources, February 1981

Morgan, Kelly B. –  The Incorporation of Uncertainty in the Air Pollution Regulation Process, September 1981

Quek, Ser Aik –  Diagnostics for Econometric Models, September 1981

Stabile, Debra –  The Design of Information Structures: Basic Allocation Strategies for Organization, September 1981

Bendixen, Lisa –  Probability Assessment: Issues of Implementation, September 1980

Brown, Richard –  A Method for Sensitivity Analysis of L.P. Decomposition Equilibrium, with Application to the Copper Industry, February 1980

Habib, Frances –  Investigating Convergence of a Capacity Planning Model Using Generalized Bender’s Decomposition, September 1980

Hook, Jack –  Market Impacts of Price Regulation in Automobile Insurance, February 1980

Lamar, Bruce W. – Optimal Machine Selection and Task Assignment in An Assembly System Design Problem, September 1980

Oum, Jai Y. – Harmonic Transformations and Gradient Curves, September 1980

Perakis, Anastassions N. –  A New Probabilistic Detection Model for Phase Random Ocean Acoustic Fluctuations and its Comparison with Data, February 1980

Shavel, Ira H. –  A Dynamic Optimization Model for Studying the Transition from Depletable Resources to New Technologies, September 1979

Brandeau, Margaret L. –  Decision Strategies for Interline Subway Control Systems, February 1978

Cozzi, Claudio –  Simple Models for a Single Route Public Transportation System, June 1978

Golush, William G. – Probabilistic Models for Optimal Seismic Design, February 1978

Sadiq, Ghazala –  Multifleet Routing Problems February 1978

Chen, Royee C. –  Nuclear Reactor Rescheduling Study, February 1977

Sultan, Fareena –  A Simulation Model of Population and Agricultural Growth in a Developing Country: A Case Study of Pakistan, June 1977

Tan, Chang-Bin –  Port Capacity Modeling of GERT and Queuing Network Approaches, June 1977

Weilmuenster, David P. –  Performance Characteristics of Signpost Automatic Vehicle Locating Systems, September 1977

Wexler, Jonathan W. –  A Methodology for Configuring Distributed Real-Time microcomputer Systems, with Applications to Inertial Navigational Systems, June 1977

Aashtiani, Hedayat Z. –  Solving Large Scale Network Optimization Problems by the Out-of-Kilter Method, February 1976

Assad, Arjang A. –  Solution Techniques for the Muti-commodity Flow Problems, June 1976

Bloom, Jeremy A. –  A Mathematical Model of Fuel Distribution in New England, February 1976

Dersin, Pierre L. –  Sensitivity Analysis of Optimal Static Traffic Assignments in a Large Freeway Corridor, Using Modern Control Theory, September 1976

Franck, Evelyn A. –  Implementing Closest Vehicle Dispatching Strategy on the Hypercube Model, February 1976

Laurent, Gilles –  A Dynamic Analysis of the Housing Market in Paris, June 1976

Lim, Joseph A. Y. –  The Effects of Socio-Eco-Demographic Factors and Family Planning Programs on Fertility, February 1976

Matsushita, Masaki –  An Application of Benders Decomposition to Steel Production, February 1976

Talafuse, David W. –  Blood Donor Attitudes and Decisions: An Exploratory Analysis, September 1976

Baldini, Vittorio A. –  Operations Research Problem in the Motion Picture Industry, February 1975

Bitran, Gabriel R. –  Duality and Sensitivity Analysis for Fractional Programs, June 1974

Facet, Tomas B. –  Role of Partial Gradient Estimation by Simulation in Water Resource Plan Formulation, February 1975

Johns, Joseph H. –  Intelligent Computer-Aided Dispatching for Urban Police Patrol Units, September 1975

Oswald, Louis J. –  Preemption – A Visible Strategy?, September 1975

Asser, Sylvain E. T. –  An Algorithm to Solve the Nth Shortest Path Problem, February 1974

Bodily, Samuel E. –  The Utilization of Frozen Red Cells in Blood Banking System: A Decision Theoretic Approach, June 1974

Brinati, Marco A. –  Analysis of the Queuing Process at an Offshore Export Terminal for Dry Bulk Cargo, September 1974

Carlton, Dennis W. –  Modeling the Effects of the Housing Allowance Program, September 1974

DeChatillon, Renaud A. –  Energy Use in the Steel Industry, June 1974

Emami, Kayvan –  An Investigation of Time Dependent Queues with Priorities, September 1974

Falk, Patrick G. –  An Optimal Replacement and Maintenance Strategy for Aircraft, June 1974

Finet, Jean-Marc P. L. –  The Calibration of Nonlinear Models, June 1974

Golden, Bruce –  A Minimum-Cost Multicommodity Network Flow Problem Concerning Imports and Exports, February 1974

Grimm, Ernst  -A Study of the Effect of Advertising on Sales, September 1974

Ulrich, Lionel Y. –  Heuristic Algorithms for Solving a Large Scale Multicommodity Flow Problem on a Network with a Step Function Cost, June 1974

Cruz-Bracho, Pedro Elias –  A Preliminary Simulation Model of Factors Affecting the Nutritional and Health Status of Children in Low-Income Families, September 1973

Layrisse, Francisco Jose –  Applications of Control Theory to Socioeconomic Systems, February 1973

Lingley, Gordon Steward –  Analysis of Interoceanic Canal Alternatives: A System Approach to Decision Making, February 1973

Ovi, Alessandro –  Decision Analysis Applied to Nuclear vs. Fossil Alternatives for Electric Energy Production, February 1973

Bell, David Edwin –  A Utility Theory Approach to Preferences for Money Over Time, June 1972

Calvo, Alberto Bruno –  Location of Health Services Facilities: A Mathematical Programming Approach, February 1972

Campbell, Gregory Lewis –  A Spatially Distributed Queuing Model for Police Patrol Sector Design, June 1972

Gelerman, Walter –  Airline Competitive Games and Airport Utilization, June 1972

Haan, Anders Henrik –  A Screening Model for Water Resource Development: Stochastic Considerations, February 1972

Honda, William Fumio –  Probabilistic Comparison of Automobile Insurance Rating Schemes, September 1972

Horgan, Dennis Neville, Jr. –  A Decision Analysis of Sewage Sludge Disposal Alternatives for Boston Harbor, September 1972

Huang, Alexander Kuang Yu –  A Market Response Model for New Consumer Durables, June 1972

Weymuller, Stanislas Bruno –  Duality Theory and Economic Analysis, June 1972

Carlson, William Edwin –  Scheduling Vehicles on Grid Networks of Automated Guideways, June 1971

Crousillat-Velasco, Cesar Oreste –  Design Considerations for Airport Landing Systems, June 1971

Kanal, Prakash Mulchand –  A Mathematical Model for a Cash Collection System, June 1971

Ketchledge, Bruce Arthur –  Optimal Bounded Control of Stochastic Production/Inventory Systems, September 1971

Rosenfield, Donald Barry –  Effects of Refractoriness in Hearing Models, February 1971

Shapiro, Roy David –  Interlaced Scheduling of Transmit-Receive Pulses, February 1971

Ting, Harold Montford –  Aggregation of Attributes for Multi attributed Utility Assessment, June 1971

Howard, Daniel Dale –  Dynamic Location-Allocation Analysis, September 1970

McDonald, Jarl W. –  The Effects of Free Capacity Transportation Networks on the Distribution of Travel Time and Traffic: A Computer Simulation, June 1970

Robinson, William Owen –  Multivariate Probability Assessment, September 1970

• DSpace@MIT Home
• MIT Libraries
• Doctoral Theses

Study Of electronic correlation and superconductivity in twisted graphene superlattices

Other Contributors

Terms of use, description, date issued, collections.

Show Statistical Information

• Diversity & Inclusion
• Community Values
• Visiting MIT Physics
• People Directory
• Faculty Awards
• History of MIT Physics
• Policies and Procedures
• Departmental Committees
• Academic Programs Team
• Finance Team
• Meet the Academic Programs Team
• Prospective Students
• Requirements
• Employment Opportunities
• Research Opportunities
• Graduate Admissions
• Doctoral Guidelines
• Financial Support
• Graduate Student Resources
• PhD in Physics, Statistics, and Data Science
• MIT LEAPS Program
• Physics Student Groups
• for Undergraduate Students
• for Graduate Students
• Mentoring Programs Info for Faculty
• Non-degree Programs
• Student Awards & Honors
• Astrophysics Observation, Instrumentation, and Experiment
• Astrophysics Theory
• Atomic Physics
• Condensed Matter Experiment
• Condensed Matter Theory
• High Energy and Particle Theory
• Nuclear Physics Experiment
• Particle Physics Experiment
• Quantum Gravity and Field Theory
• Quantum Information Science
• Strong Interactions and Nuclear Theory
• Center for Theoretical Physics
• Affiliated Labs & Centers
• Program Founder
• Competition
• Donor Profiles
• Patrons of Physics Fellows Society
• Giving Opportunties
• physics@mit Journal: Fall 2023 Edition
• Events Calendar
• Physics Colloquia
• Search for: Search

Thesis Information

Upcoming thesis defenses.

If you are defending this term and do not see your information listed, please contact Sydney Miller in the APO.

Forming a Thesis Committee

When : Doctoral Students – After completing the written and oral exams and generally by the beginning of their third Year of study. Forming their committees at this stage will allow students to consult with all members of the committee during their studies and can provide additional advice and mentorship for them.

How : Register for thesis research under subject number 8.ThG, form a thesis committee, meet with full committee, and submit a formal thesis proposal to the department.

Thesis Committee Formation

Student should consult with their Research Supervisor to discuss the Doctoral Thesis Committee Proposal Form which will name the 3 required members of the Physics Doctoral Committee and a descriptive preliminary thesis title. 

Doctoral Committee must include 3 members with MIT Physics faculty appointments:

• Committee Chair: Research Supervisor from MIT Physics Faculty or Research Supervisor from outside MIT Physics + Co-Supervisor/Chair from MIT Physics Faculty
• Selected Reader: from MIT Physics Faculty (in the same/similar research area, selected by student and supervisor)
• Assigned Reader: from MIT Physics Faculty (in different research area, selected by the Department’s faculty Graduate Coordinator.)

The Form should include the names of the Student, Chair, and Selected Reader and a Thesis Title, when it is forwarded to the Academic Programs Office via email to [email protected] and Sydney will work with Faculty Graduate Coordinator Will Detmold , who will identify the Assigned Reader.

Following the consultation with their supervisor, the student should reach out to the proposed Selected Reader to secure an electronic signature or email confirmation in lieu of signature to serve on this committee. (Form should include either signature or date of email agreement.) It will take approximately 2-3 weeks before an Assigned Reader will be added and Sydney will provide an introduction to this final member of your Doctoral Committee. Please note: you may not form your committee and defend your thesis in the same semester.

Thesis Committee Meeting and Proposal

Once the Thesis Committee is established, the student should send all members a draft description of the proposed thesis topic and set up the first committee meeting with all members attending together in real time. A formal 2-page written Thesis Proposal should result from this important meeting and be sent to Sydney for the student’s academic record.  

Thesis Proposal

You should discuss your thesis research with your committee members all together in real time at your first committee meeting. Following this full discussion about your thesis topic, please write up your formal Thesis Proposal to reflect the mutually-agreed thesis plans and forward the Proposal to the graduate program at the APO using [email protected] for Sydney to document in the department’s academic records.

Thesis Research

Following the formation of the doctoral committee and submission of the thesis proposal, the student will continue to work on their thesis research in consultation with their Research Supervisor and other members of their Committee. This important communication paves the way for the thesis defense and degree completion.

When students are ready to defend, they should complete an ‘ Application for Advanced Degree ’ with the Registrar and schedule a thesis defense with all committee members attending in real time, whether in person or by video. Announcements for the defense will be coordinated by the Academic Programs Office and students should be in close contact with Sydney Miller during their final term or study.

Further details about this last stage of your studies will be available separately.

Thesis Defense

If there is even a slight possibility that you may finish this term, please complete an Application for Advanced Degree at the Registrar’s website at the beginning of the term. It is easy to remove your name if your plans change, but this timely step will avoid late fees!

Once you have scheduled your defense, please send this information to Sydney at [email protected] :

• Thesis Title:
• Committee Members:
• Meeting Details: (can be sent in the final week before the defense)

She will create the email notifications for our physics community and the MIT Events and Physics Calendar listings. This information you provide her is also used to generate the defense grade sheet for your defense.

Please send your committee members a thesis draft to help them prepare for your defense and plan to spend around two weeks making thesis revisions after your successful defense. The date you submit your thesis document to the department will determine whether it is for a Fall, Spring, or Summer degree.

Thesis Formatting

Archival copies of all theses must adhere carefully to principles specified by the MIT Libraries for formatting and submission. For complete information about how to format your thesis, refer to the  Specifications for Thesis Preparation .

Graduate Program Coordinator Sydney Miller can review your title page and abstract for accuracy before you submit the thesis. You may send these to her at  [email protected].

Required Signatures and Documentation

• Signatures:  The MIT Archives require an electronic PDF document and the Department needs a separate additional stand-alone title page with electronic/scanned signatures of   the student, research supervisor, and co-supervisor (if applicable). Theses are accepted by Associate Department Head, Professor  Lindley Winslow . Please send your documents to  [email protected]  and the APO staff will forward your thesis submitted to the MIT Library Archives.
• Thesis defense grade sheets:  Before accepting a PhD thesis, the Academic Programs Office must have a signed thesis defense grade sheet from the research supervisor indicating a “Pass” on the thesis defense.
• Thesis letter grade:  Before accepting an SM thesis, Academic Programs must have received a letter or email from the research supervisor, assigning a final thesis grade of A, B, or C.

Finalizing and Submitting your Thesis to MIT

Departments collect the thesis documents on behalf of the MIT Thesis Library Archives and Physics graduate students will submit their thesis to Sydney Miller.  Review overall information from MIT about  thesis specifications and format .

Please see the attached doctoral title page format for Physics and send your draft of the title/cover page and abstract to Sydney for review and any necessary edits. Once these are approved, please prepare the full document, with pagination appropriate for double-sided printing.

Theses may be completed and signed on any date of the year and the degree requirements are completed when the thesis is submitted. This is the final day of student status and payroll. (International students are eligible for Optional Practical Training starting on the following day.)

MIT awards degrees at the end of each term:

• Fall Term degree is in February. (Theses due second Friday in January.)
• Spring Term degree is in May. (Theses due second Friday in May.)
• Summer Term degree is in September. (Theses due second Friday in August.)

Thesis submissions are electronic files and you will submit the following to Sydney:

• A complete thesis document, without signatures
• A title page with electronic signatures from yourself, your supervisor (and co-supervisor, if required). Sydney will work with the Associate Head, Lindley Winslow , whose signature is required for the department and this will be added after you submit your document to the department/Sydney.
• A separate abstract page

Doctoral students also complete and submit the  Proquest/UMI form  (PDF), with attached title page and abstract (no signatures).

In addition to submitting your thesis to the department for the library archives, you may also  add your thesis to DSpace .

Digital Submission Guidelines

All theses are being accepted by the MIT Libraries in  digital form only . Digital theses are submitted electronically to the Physics Department, along with a separate signed title page. Students on the degree list will receive specific guidance about submission from the Academic Programs Office.

General Thesis Policies

All theses are archived in the MIT Libraries. An archival fee must be paid before a student’s final candidacy for a degree can be officially approved.

After all required materials have been submitted to the Academic Programs Office, a thesis receipt will be sent by email.

Thesis Due Dates

Check the MIT Academic Calendar for deadlines to submit your online degree application.

Thesis submission deadlines Graduating in May: Second Friday in May Graduating in September: Second Friday in August Graduating in February: Second Friday in January We strongly recommend that your defense be scheduled at least three weeks prior to the submission date. Consult with Academic Administrator Shannon Larkin to determine your thesis submission timeline.

Thesis FAQs

The information on this page is applicable for both PhD and Masters (with the exception of an Oral defense) degree candidates.

How do I submit a Thesis Proposal? When is it due?

Students register for thesis research units and assemble a thesis committee in the term following passing the Oral Exam.

The first step is for the student and research supervisor to agree on a thesis topic. An initial Graduate Thesis Proposal Cover Sheet (PDF) (Master’s Degree candidates should see process in section below) must be submitted to Academic Programs by the second week of the term.

The form requires

• an initial thesis title
• the name and signature of the research supervisor
• the name of one additional reader for the thesis committee agreed upon by the student and advisor

A third reader from the MIT Physics faculty, who is not in the same research area but whose background makes him or her an appropriate departmental representative on the committee, will be assigned by the Graduate Program Faculty Coordinator. If a student has a co-supervisor (because the main supervisor is from outside the MIT Physics faculty), the thesis committee will consist of four people: research supervisor, co-supervisor, selected reader, and assigned reader.

After the student is notified of the assigned reader, he or she should convene an initial thesis committee meeting within the same term. The student should also register for 8.THG beginning in this term, and in each term thereafter. 8.THG registration should be for up to 36 units, depending on whether the student is also still taking classes and/or receiving academic credit because of a teaching assistantship. All post-qual students should routinely register for a standard total 36 units.

Master’s degree candidates should complete an SM Thesis Proposal Cover Sheet (PDF). A second reader for the Master’s degree thesis committee is assigned by the Graduate Program Faculty Coordinator. Note that there is no public defense required for an SM degree.

See the Doctoral Guidelines for additional information.

I am going to graduate soon–what do I have to do in terms of paperwork etc.?

Please reference the Registrar’s complete graduation checklist . Students should reference this list at the START of the semester prior to graduation. Your research area’s administrative office and the Physics APO will also help you manage the final stage of your degree.

How do I get on/off the Degree List?

Fill out the Degree Application through the student section of WebSIS . Petitioning to be on the degree list for a particular commencement is required. Note that it is easier to be removed from the degree list to be added, so students are encouraged to apply for the degree list if there is any reasonable chance they will complete the PhD in the coming term.

The WebSIS degree list is used to communicate information about thesis defense announcements and grade sheets, thesis formats, and completion dates, so it is important to file a degree application to be on the list in a timely way. The standard deadline for filing a degree application without being assessed a late fee is the Friday of the first week of the term in which a student anticipates graduating. Removing oneself from the degree list requires an email to Academic Programs .

When is my thesis due? Can I get an extension?

Students can defend and submit their thesis on any dates that work for their committees, but MIT confers degrees only 3 times each year: in May, September and February. Thesis submission deadlines Graduating in May: Second Friday in May Graduating in September: Second Friday in August Graduating in February: Second Friday in January We strongly recommend that your defense be scheduled at least three weeks prior to the submission date. Consult with Academic Administrator Shannon Larkin to determine your thesis submission timeline.

Note that these deadlines are already more generous that the Institute thesis deadline. Students desiring extensions should contact the Academic Administrator, Shannon Larkin .

How do I find a room for my Thesis Defense?

Many Divisions have conference and/or seminar rooms which can be used for oral exams and defenses. These locations are recommended to keep your Thesis Defense comfortable and in familiar territory. Students who cannot book a room in their research area should contact Sydney Miller in the Physics APO to check availability of a Physics departmental conference room (often difficult to schedule due to heavy demand) or to help schedule a classroom through the Registrar’s Office.

When I submit my thesis to Physics Academic Programs, what do I need to bring?

Please refer to the Graduate Thesis Submission Guidelines .

The thesis comprises an original investigation, including a written document on a subject approved by a departmental or interdepartmental graduate committee prior to the beginning of the research. Thesis credit cannot be granted for work done prior to registration as a graduate student at the Institute, nor for work initiated without prior approval by the department of registration. The thesis must be completed while in residence, except as noted below.

A thesis may not be presented on research work done at the Institute while on academic, administrative, research staff appointment, or hourly payroll at MIT (including Lincoln Laboratory), the Charles Stark Draper Laboratory, or other affiliated research entities. Supervision by a faculty member of the Institute or a staff member approved by the department is a fixed requirement for doctoral, engineer’s, and master’s theses. Preliminary plans for pursuing an approved thesis may be required by thesis advisors according to the requirements and time schedules of the departments. A thesis advisor may, at his or her discretion, require progress reports in oral or written form as deemed necessary. Before the final written document is submitted, a draft may be required for editorial comment. An oral examination of the doctoral thesis will be held after the thesis has been submitted. The thesis process is not complete until the thesis document is signed, and therefore accepted formally, by the department.

Nonresident doctoral thesis research status

Details and expectations for non-residential doctoral students. Students must have passed the qualifying examination to be eligible to request this status.

Holds and restrictions on thesis publication

Information on thesis hold requests related to patent protection, pursuit of business opportunities, government restrictions, privacy and security, and book publication

Copyright and intellectual property policy

Information on the Institute’s policy concerning ownership of copyrights and rights to intellectual property

Preparation of graduate theses

Information for preparing a thesis

Joint theses

Details and expectations for collaborative research

Thesis research in absentia

Details and expectations for students conducting research off-campus. Students in both master’s and doctoral programs, at any stage in their studies, are eligible to request this status.

This site uses cookies to give you the best possible experience. By browsing our website, you agree to our use of cookies.

If you require further information, please visit the Privacy Policy page.

MIT Libraries logo MIT Libraries

MIT Specifications for Thesis Preparation

Approved November 2022 for use in the 2022-2023 academic year. Updated March 2023 to incorporate changes to MIT Policies and Procedures 13.1.3 Intellectual Property Not Owned by MIT .

View this page as an accessible PDF .

Table of Contents

• Thesis Preparation Checklist

Timeline for submission and publication

• Bachelor’s degree thesis
• Graduate degree thesis

Dual degree theses

Joint theses, what happens to your thesis, title selection, embedded links.

• Special circumstances

Signature page

Abstract page.

• Acknowledgments

Biographical notes

Table of contents, list of figures.

• List of tables
• List of supplemental material

Notes and bibliographic references

Open licensing, labeling copyright in your thesis, use of previously published material in your thesis, digital supplementary material, physical supplementary material, starting with accessible source files, file naming.

• How to submit thesis information to the MIT Libraries

Placing a temporary hold on your thesis

Changes to a thesis after submission, permission to reuse or republish from mit theses, general information.

This guide has been prepared by the MIT Libraries, as prescribed by the Committee on Graduate Programs and the Committee on Undergraduate Program, to assist students and faculty in the preparation of theses. The Institute is committed to the preservation of each student’s thesis because it is both a requirement for the MIT degree and a record of original research that contains information of lasting value.

In this guide, “department” refers to a graduate or undergraduate program within an academic unit, and “thesis” refers to the digital copy of the written thesis. The official thesis version of record, which is submitted to the MIT Libraries, is the digital copy of the written thesis that has been approved by the thesis committee and certified by the department in fulfillment of a student’s graduation requirement.

The requirements in this guide apply to all theses and have been specified both to facilitate the care and dissemination of the thesis and to assure the preservation of the final approved document. Individual departments may dictate more stringent requirements.

Before beginning your thesis research, remember that the final output of this research—your thesis document—should only include research findings that may be shared publicly, in adherence with MIT’s policy on Open Research and Free Interchange of Information . If you anticipate that your thesis will contain content that requires review by an external sponsor or agency, it is critical that you allow sufficient time for this review to take place prior to thesis submission. 

Questions not answered in this guide should be referred to the appropriate department officer or to the MIT Libraries ( [email protected] ).

• Final edited and complete thesis PDF is due to your department on the date specified in the Academic Calendar.
• Hold requests should be submitted to the Vice Chancellor for Undergraduate and Graduate Education or TLO concurrent with your thesis submission.
• Thesis information is due to the MIT Libraries before your date of graduation.
• Departments must transfer theses to the MIT Libraries within 30 days from the last day of class (end of term).
• One week later (30 days from the last day of classes + 7 days) or one week after the degree award date (whichever is later) the MIT Libraries may begin publishing theses in DSpace@MIT.
• If you have requested and received a temporary (up to 90-day) hold on the publication of your thesis from the Vice Chancellor, your thesis will be placed on hold as soon as it is received by the Libraries, and the 90-day hold will begin 30 days from the last day of class (end of term).
• If your thesis research is included in a disclosure to the TLO, the TLO may place your thesis on temporary hold with the Libraries, as appropriate.

Submitting your thesis document to your department

Your thesis document will be submitted to your department as a PDF, formatted and including the appropriate rights statement and sections as outlined in these specifications. Your department will provide more specific guidance on submitting your files for certification and acceptance.

Your department will provide information on submitting:

• A PDF/A-1  of your final thesis document (with no signatures)
• Signature page (if required by your department; your department will provide specific guidance)
• Original source files used to create the PDF of your thesis (optional, but encouraged)
• Supplementary materials  (optional and must be approved by your advisor and program)

Degree candidates must submit their thesis to the appropriate office of the department in which they are registered on the dates specified in the Academic Calendar. ( Academic Calendar | MIT Registrar ). September, February, and May/June are the only months in which degrees are awarded.

Bachelor’s degree theses

Graduate degree theses, submitting your thesis information to the libraries.

Information about your thesis must be submitted to the Libraries thesis submission and processing system  prior to your day of graduation. The information you provide must match the title page and abstract of your thesis . See How to submit thesis information to the MIT Libraries section for more details .

The academic department is required to submit the thesis to the MIT Libraries within one month after the last day of the term in which the thesis was submitted ( Faculty Regulation 2.72 ). The thesis document becomes part of the permanent archival collection. All thesis documents that have been approved will be transferred electronically to the MIT Libraries by a department representative via the MIT Libraries thesis submission and processing system .

The full-text PDF of each thesis is made publicly available in DSpace@MIT . A bibliographic record will appear in the MIT Libraries’ catalog, as well as the OCLC database WorldCat, which is accessible to libraries and individuals worldwide. Authors may also opt-in to having their thesis made available in the ProQuest Dissertations & Theses Global database.

Formatting specifications

Your work will be a more valuable research tool for other scholars if it can be located easily. Search engines use the words in the title, and sometimes other descriptive words, to locate works. Therefore,

• Be sure to select a title that is a meaningful description of the content of your manuscript; and
• Do: “The Effects of Ion Implantation and Annealing on the Properties of Titanium Silicide Films on Silicon Substrates”
• Do: “Radiative Decays on the J/Psi to Two Pseudoscalar Final States”

You may include clickable links to online resources within the thesis file. Make the link self-descriptive so that it can stand on its own and is natural language that fits within the surrounding writing of your paragraph. The full URL should be included as a footnote or bibliography citation (dependent on citation style).

• Sentence in thesis: Further information is available on the MIT Writing and Communications Center’s website . The full-text PDF of each thesis is made publicly available in DSpace@MIT .
• Footnote or Bibliography: follow the rules of your chosen citation style and include the full website URL, in this case http://libraries.mit.edu/mit-theses

Sections of your thesis

Required (all information should be on a single page)

The title page should contain the title, name of the author (this can be the author’s preferred name), previous degrees, the degree(s) to be awarded at MIT, the date the degree(s) will be conferred (May/June, September, or February only), copyright notice (and legend, if required), and appropriate names of thesis supervisor(s) and student’s home department or program officer.

The title page should have the following fields in the following order and centered (including spacing) :

Thesis title as submitted to registrar

Author’s preferred name

Previous degree information, if applicable

Submitted to the [department name] in partial fulfillment of the requirements for the degree(s) of

[degree name]

Massachusetts Institute of Technology

Month and year degree will be granted (May or June, September, February ONLY)

Copyright statement

This permission legend MUST follow: The author hereby grants to MIT a nonexclusive, worldwide, irrevocable, royalty-free license to exercise any and all rights under copyright, including to reproduce, preserve, distribute and publicly display copies of the thesis, or release the thesis under an open-access license.

[Insert 2 blank lines]

Note: The remaining fields are left aligned and not centered

Authored by: [Author name]

[Author’s department name] (align with the beginning of the author’s name from the previous line)

[Date thesis is to be presented to the department] (align with the beginning of the author’s name from the first line)

Certified by: [Advisor’s full name as it appears in the MIT catalog]

   [Advisor’s department as it appears in the MIT catalog] (align with the beginning of the advisor’s name from the previous line), Thesis supervisor

Accepted by: [name]

[title – line 1] (align with the beginning of the name from the previous line)

[title – line 2] (align with the beginning of the name from the first line)

Note: The name and title of this person varies in different degree programs and may vary each term; contact the departmental thesis administrator for specific information

• Students in joint graduate programs (such as Harvard-MIT Health Sciences and Technology and Woods Hole Oceanographic Institution) should list both their MIT thesis supervisor and the supervisor from the partner academic institution.
• The name and title of the department or the program officer varies in different degree programs and may vary each term. Contact the departmental graduate administrator for specific information.
• For candidates receiving two degrees, both degrees to be awarded should appear on the title page. For candidates in dual degree programs, all degrees and departments or programs should appear on the title page, and the names of both department heads/committee chairs are required. Whenever there are co-supervisors, both names should appear on the title page.

Here are some PDF examples of title pages:

• Bachelor’s Degree – using a Creative Commons license
• PhD candidate – using a Creative Commons license
• Master’s candidate – dual degrees
• Masters’ candidates – multiple authors
• Masters’ candidates – multiple authors with dual degrees and extra committee members
• Bachelor’s Degree – change of thesis supervisor

Title page: Special circumstances – change of thesis supervisor

If your supervisor has recently died or is no longer affiliated with the Institute:

• Both this person and your new supervisor should be listed on your title page
• Under the new supervisor’s name, state that they are approving the thesis on behalf of the previous supervisor
• An additional page should be added to the thesis, before the acknowledgments page, with an explanation about why a new supervisor is approving your thesis on behalf of your previous supervisor. You may also thank the new supervisor for acting in this capacity
• Review this PDF example of a title page with a change in supervisor

If your supervisor is external to the Institute (such as an industrial supervisor):

• You should acknowledge this individual on the Acknowledgements page as appropriate, but should not list this person on the thesis title page
• The full thesis committee and thesis readers can be acknowledged on the Acknowledgements page, but should not be included on the title page

Not Required

Please consult with your department to determine if they are requiring or requesting an additional signature page.

Each thesis must include an abstract of generally no more than 500 words single-spaced. The abstract should be thought of as a brief descriptive summary, not a lengthy introduction to the thesis. The abstract should immediately follow the title page.

The abstract page should have the following fields in the following order and centered (including spacing):

• Thesis title

Submitted to the [Department] on [date thesis will be submitted] in Partial Fulfillment of the Requirements for the Degree of [Name of degree to be received]

[Insert 1 blank line]

Single-spaced summary; approximately 500 words or less; try not to use formulas or special characters

Thesis supervisor: [Supervisor’s name]

Title: [Title of supervisor]

The Abstract page should include the same information as on the title page. With the thesis title, author name, and submitting statement above the abstract, the word “ABSTRACT” typed before the body of the text, and the thesis supervisor’s name and title below the abstract.

Acknowledgements

An acknowledgement page may be included and is the appropriate place to include information such as external supervisor (such as an industrial advisor) or a list of the full thesis committee and thesis readers. Please note that your thesis will be publicly available online at DSpace@MIT , which is regularly crawled and indexed by Google and other search-engine providers.

The thesis may contain a short biography of the candidate, including institutions attended and dates of attendance, degrees and honors, titles of publications, teaching and professional experience, and other matters that may be pertinent. Please note that your thesis will be publicly available online at DSpace@MIT , which is regularly crawled and indexed by Google and other search-engine providers.

List of Tables

List of supplemental material.

Whenever possible, notes should be placed at the bottom of the appropriate page or in the body of the text. Notes should conform to the style appropriate to the discipline. If notes appear at the bottom of the page, they should be single-spaced and included within the specified margins.

It may be appropriate to place bibliographic references either at the end of the chapter in which they occur or at the end of the thesis.

The style of quotations, footnotes, and bibliographic references may be prescribed by your department. If your department does not prescribe a style or specify a style manual, choose one and be consistent. Further information is available on the MIT Writing and Communications Center’s website .

Ownership of copyright

The Institute’s policy concerning ownership of thesis copyright is covered in Rules and Regulations of the Faculty, 2.73 and MIT Policies and Procedures 13.1.3 . Copyright covers the intellectual property in the words and images in the thesis. If the thesis also includes patentable subject matter, students should contact the Technology Licensing Office (TLO) prior to submission of their thesis.

Under these regulations, students retain the copyright to student theses.

The student must, as a condition of a degree award, grant to MIT a nonexclusive, worldwide, irrevocable, royalty-free license to exercise any and all rights under copyright, including to reproduce, preserve, distribute and publicly display copies of the thesis, or release the thesis under an open-access license. The MIT Libraries publish the thesis on DSpace@MIT , allowing open access to the research output of MIT.

You may also, optionally, apply a Creative Commons License to your thesis. The Creative Commons License allows you to grant permissions and provide guidance on how your work can be reused by others. For more information about CC: https://creativecommons.org/about/cclicenses/ . To determine which CC license is right for you, you can use the CC license chooser .

You must include an appropriate copyright notice on the title page of your thesis. This should include the following:

• the symbol “c” with a circle around it © and/or the word “copyright”
• the year of publication (the year in which the degree is to be awarded)
• the name of the copyright owner
• the words “All rights reserved” or your chosen Creative Commons license
• Also include the following statement below the ©“ The author hereby grants to MIT a nonexclusive, worldwide, irrevocable, royalty-free license to exercise any and all rights under copyright, including to reproduce, preserve, distribute and publicly display copies of the thesis, or release the thesis under an open-access license.”
• Also include the following statement below the © “The author hereby grants to MIT a nonexclusive, worldwide, irrevocable, royalty-free license to exercise any and all rights under copyright, including to reproduce, preserve, distribute and publicly display copies of the thesis, or release the thesis under an open-access license.”

You are responsible for obtaining permission, if necessary, to include previously published material in your thesis. This applies to most figures, images, and excerpts of text created and published by someone else; it may also apply to your own previous work. For figures and short excerpts from academic works, permission may already be available through the MIT Libraries (see here for additional information ). Students may also rely on fair use , as appropriate. For assistance with copyright questions about your thesis, Ask Scholarly Communications .

When including your own previously published material in your thesis, you may also need to obtain copyright clearance. If, for example, a student has already published part of the thesis as a journal article and, as a condition of publication, has assigned copyright to the journal’s publisher, the student’s rights are limited by what the publisher allows. More information about publisher policies on reuse in theses is available here.

Students can hold onto sufficient rights to reuse published articles (or excerpts of these) in their thesis if they are covered by MIT’s open access policy. Learn more about MIT’s open access policy and opt-in here . Ask Scholarly Communications for more information.

When including your own previously published articles in your thesis, check with your department for specific requirements, and consider the following:

• Ensure you have any necessary copyright permissions to include previously published material in your thesis.
• Be sure to discuss copyright clearance and embargo options with your co-authors and your advisor well in advance of preparing your thesis for submission.
• Include citations of where portions of the thesis have been previously published.
• When an article included has multiple authors, clearly designate the role you had in the research and production of the published paper that you are including in your thesis.

Supplemental material and research data

Supplemental material that may be submitted with your thesis is the materials that are essential to understanding the research findings of your thesis, but impossible to incorporate or embed into a PDF. Materials submitted to the MIT Libraries may be provided as supplemental digital files or in some cases physical items. All supplementary materials must be approved for submission by your advisor. The MIT Libraries can help answer questions you may have about managing the supplementary material and other research materials associated with your research.

Contact [email protected] early in your thesis writing process to determine the best way to include supplemental materials with your thesis.

You may also have other research data and outputs related to your thesis research that are not considered supplemental material and should not be submitted with your thesis. Research materials include the facts, observations, images, computer program results, recordings, measurements, or experiences on which a research output—an argument, theory, test or hypothesis, or other output—is based. These may also be termed, “research data.” This term relates to data generated, collected, or used during research projects, and in some cases may include the research output itself. Research materials should be deposited in appropriate research data repositories and cited in your thesis . You may consult the MIT Libraries’ Data Management Services website for guidance or reach out to Data Management Services (DMS)( [email protected] ), who can help answer questions you may have about managing your thesis data and choosing suitable solutions for longer term storage and access.

• Supplementary information may be submitted with your thesis to your program after approval from your thesis advisor. 
• Supplemental material should be mentioned and summarized in the written document, for example, using a few key frames from a movie to create a figure.
• A list of supplementary information along with brief descriptions should be included in your thesis document. For digital files, the description should include information about the file types and any software and version needed to open and view the files.
• Issues regarding the format of non-traditional, supplemental content should be resolved with your advisor.
• Appendices and references are not considered supplementary information.
• If your research data has been submitted to a repository, it should not also be submitted with your thesis.
• Follow the required file-naming convention for supplementary files: authorLastName-kerb-degree-dept-year-type_supplemental.ext
• Captioning ( legally required ): text versions of the audio content, synchronized with the video: ways to get your video captioned
• Additional content, not required:
• For video, an audio description: a separate narrative audio track that describes important visual content, making it accessible to people who are unable to see the video
• Transcripts: should capture all the spoken audio, plus on-screen text and descriptions of key visual information that wouldn’t otherwise be accessible without seeing the video

For physical components that are integral to understanding the thesis document, and which cannot be meaningfully conveyed in a digital form, the author may submit the physical items to the MIT Libraries along with their thesis document. When photographs or a video of a physical item (such as a model) would be sufficient, the images should be included in the thesis document, and a video could be submitted as digital supplementary material.

An example of physical materials that would be approved for submission as part of the thesis would be photographs that cannot be shared digitally in our repository due to copyright restrictions. In this case, the photographs could be submitted as a physical volume that is referred to in the thesis document.

As with digital supplementary information and research materials, physical materials must be approved for submission by your advisor. Contact [email protected] early in your thesis writing process to determine if physical materials should accompany your thesis, and if so how to schedule a transfer of materials to the MIT Libraries.

Creating your thesis document/digital format

You are required to submit a PDF/A-1 formatted thesis document to your department. In addition, it is recommended that original files, or source files, (such a .doc or .tex) are submitted alongside the PDF/A-1 to better ensure long-term access to your thesis.

You should create accessible files that support the use of screen readers and make your document more easily readable by assistive technologies. This will expand who is able to access your thesis. By creating an accessible document from the beginning, there will be less work required to remediate the PDF that gets created. Most software offers a guide for creating documents that are accessible to screen readers. Review the guidelines provided by the MIT Libraries .

In general:

• Use styles and other layout features for headings, lists, tables, etc. If you don’t like the default styles associated with the headings, you can customize them.
• Avoid using blank lines to add visual spacing and instead increase the size of the spaces before and/or after the line.
• Avoid using text boxes.
• Embed URLs.
• Anchor images to text when inserting them into a doc.
• Add alt-text to any images or figures that convey meaning (including, math formulas).
• Use a sans serif font.
• Add basic embedded metadata, such as author, title, year of graduation, department, keywords etc. to your thesis via your original author tool.

Creating a PDF/A-1

PDF/A-1 (either a or b) is the more suitable format for long term preservation than a basic PDF. It ensures that the PDF format conforms to certain specifications which make it more likely to open and be viewable in the long term. It is best for static content that will not change in the future, as this is the most preservation-worthy version and does not allow for some complex elements that could corrupt or prevent the file from being viewable in the future. Guidelines on how to convert specific file types to PDF/A .

In general: (should we simplify these bullets)

• Convert to PDF/A directly from your original files (text, Word, InDesign, LaTeX, etc.). It is much easier and better to create valid PDF/A documents from your original files than from a regular PDF. Converting directly will ensure that fonts and hyperlinks are embedded in the document.
• Do not embed multimedia files (audio and video), scripts, executables, lab notebooks, etc. into your PDF. Still images are fine. The other formats mentioned may be able to be submitted as supplemental files.
• Do not password protect or encrypt your PDF file.
• Validate your PDF/A file before submitting it to your department.

All digital files must be named according to this scheme: authorLastName-kerb-degree-dept-year-type_other.ext

• Thesis PDF: macdonald-mssimon-mcp-dusp-2023-thesis.pdf
• Signature page: macdonald-mssimon-mcp-dusp-2023-sig.pdf
• Original source file: macdonald-mssimon-mcp-2023-source.docx
• Supplemental file: macdonald-mssimon-mcp-2023-supplmental_1.mov
• Second supplemental file: macdonald-mssimon-mcp-2023-supplmental_2.mov
• Read Me file about supplemental: macdonald-mssimon-mcp-2023-supplemental-readme.txt

How to submit thesis information to the MIT Libraries

Before your day of graduation, you should submit your thesis title page metadata to the MIT Libraries  prior to your day of graduation. The submission form requires Kerberos login.

Student submitted metadata allows for quicker Libraries processing times. It also provides a note field for you to let Libraries’ staff know about any metadata discrepancies.

The information you provide must match the title page and abstract of your thesis . Please have a copy of your completed thesis on hand to enter this information directly from your thesis. If any discrepancies are found during processing, Libraries’ staff will publish using the information on the approved thesis document. You will be asked to confirm or provide:

• Preferred name of author(s)as they appear on the title page of the thesis
• ORCID provides a persistent digital identifier that distinguishes you from every other researcher. The goal is to support the creation of a permanent, clear, and unambiguous record of scholarly communication by enabling reliable attribution of authors and contributors. Read ORCID FAQs to learn more
• Department(s)
• A license is optional, and very difficult to remove once published. The Creative Commons License allows you to grant permissions and provide guidance on how your work can be reused by others. Read more information about CC .
• Thesis supervisor(s)
• If you would like the full-text of your thesis to be made openly available in the ProQuest Dissertation & Theses Global database (PQDT), you can indicate that in the Libraries submission form.
• Open access inclusion in PQDT is at no cost to you, and increases the visibility and discoverability of your thesis. By opting in you are granting ProQuest a license to distribute your thesis in accordance with ProQuest’s policies. Further information can be found in the ProQuest Dissertations and Theses Author FAQ .
• Full-text theses and associated supplemental files will only be sent to ProQuest once any temporary holds have been lifted, and the thesis has been published in DSpace@MIT.
• Regardless of opting-in to inclusion in PQDT, the full text of your thesis will still be made openly available in DSpace@MIT . Doctoral Degrees: Regardless of opting-in the citation and abstract of your thesis will be included in PQDT.

Thesis research should be undertaken in light of MIT’s policy of open research and the free interchange of information . Openness requires that, as a general policy, thesis research should not be undertaken on campus when the results may not be published. From time to time, there may be a good reason for delaying the distribution of a thesis to obtain patent protection, or for reasons of privacy or security. To ensure that only those theses that meet certain criteria are withheld from distribution and that they are withheld for the minimum period, the Institute has established specific review procedures.

Written notification of patent holds and other restrictions must reach the MIT Libraries before the thesis in question is received by the MIT Libraries. Theses will not be available to the public prior to being published by the MIT Libraries. The Libraries may begin publishing theses in DSpace@MIT one month and one week from the last day of classes.

Thesis hold requests should be directed to the Technology Licensing Office (TLO) ( [email protected] ) when related to MIT-initiated patent applications (i.e., MIT holds intellectual property rights; patent application process via TLO). Requests for a thesis hold must be made jointly by the student and advisor directly to the MIT Technology Licensing Office as part of the technology disclosure process.

Thesis hold or restricted access requests should be directed to the Office of the Vice Chancellor ([email protected]) when related to:

• Student-initiated patents (student holds intellectual property rights as previously determined by TLO) [up to 90-day hold]
• Pursuit of business opportunities (student holds intellectual property rights as previously determined by TLO)[up to 90-day hold]
• Government restrictions [up to 90-day hold]
• Privacy and security [up to 90-day hold]
• Scholarly journal articles pending publication [up to 90-day hold]
• Book publication [up to 24-month hold]

In the unusual circumstance that a student wants to request a hold beyond the initial 90-day period, they should contact the Office of Vice President for Research , who may consult with the TLO and/or the Office of the Vice Chancellor, as appropriate to extend the hold. Such requests must be supported by evidence that explains the need for a longer period.

Find information about each type of publication hold, and to learn how to place a hold on your thesis

After publication

Your thesis will be published on DSpace@MIT . Theses are processed by the MIT Libraries and published in the order they are transferred by your department. The Libraries will begin publishing theses in DSpace@MIT one month and one week from the last day of classes.

All changes made to a thesis, after it has been submitted to the MIT Libraries by your department, must have approval from the Vice Chancellor or their designee. Thesis documents should be carefully reviewed prior to submission to ensure they do not contain misspellings or incorrect formatting. Change requests for these types of minor errors will not be approved.

There are two types of change requests that can be made:

• Errata: When the purpose is to correct significant errors in content, the author should create an errata sheet using the form and instructions (PDF)  and obtain approval first from both the thesis supervisor or program chair, before submitting for review by the Vice Chancellor.
• Substitution: If the purpose of the change is to excise classified, proprietary, or confidential information, the author should fill out the  application form (PDF) and have the request approved first by the thesis supervisor or program chair, before submitting for review by the Vice Chancellor.

Students and supervisors should vet thesis content carefully before submission to avoid these scenarios whenever possible.

You are always authorized to post electronic versions of your own thesis, in whole or in part, on a website, without asking permission. If you hold the copyright in the thesis, approving and/or denying requests for permission to use portions of the thesis in third-party publications is your responsibility.

MIT Libraries Thesis Team https://libguides.mit.edu/mit-thesis-faq [email protected] | https://thesis-submit.mit.edu/

Distinctive Collections Room 14N-118 | 617-253-5690 https://libraries.mit.edu/distinctive-collections/

Technology Licensing Office [email protected] | 617-253-6966 http://tlo.mit.edu/

Office of the General Counsel [email protected]  | 617-452-2082 http://ogc.mit.edu/

Office of Graduate Education Room 3-107 | 617-253-4680 http://oge.mit.edu/ [email protected]

MIT Libraries,  Scholarly Communications https://libraries.mit.edu/scholarly/ Ask Scholarly Communications

Office of  the Vice Chancellor Room 7-133 | 617-253-6056 http://ovc.mit.edu [email protected]

Office of the Vice President for Research Room 3-234 | 617-253-8177 [email protected]

MIT Writing and Communications Center Room E18-233 [email protected] | https://cmsw.mit.edu/writing-and-communication-center/

• CSE PhD Overview
• Dept-CSE PhD Overview
• CSE Doctoral Theses
• Program Overview and Curriculum
• For New CCSE Students
• Terms of Reference

A listing of CSE PhD and SM thesis titles and authors can be found at DSpace@MIT . Note, SM theses completed before September 2020 will be classified under Computation for Design and Optimization (CDO), CSE’s original program name.

MIT Thesis FAQ: Thesis Checklist

• New Degree Candidates
• Thesis Checklist
• Creating an Accessible Thesis
• Saving Your Thesis as a PDF/A-1
• Student Frequently Asked Questions
• Access and Availability Questions

If these apply to you and your research, plan to do these early in your research and writing process!

Preparing your thesis for submission

At time of submission

Quick links

• Thesis Specifications
• Distinctive Collections
• Scholarly Publishing@MIT
• About DSpace@MIT
• Dissertation/Theses
• Official Overleaf Thesis Template

Have questions?

Contact us at [email protected] .

• << Previous: New Degree Candidates
• Next: Creating an Accessible Thesis >>
• Last Updated: Aug 1, 2024 11:10 AM
• URL: https://libguides.mit.edu/mit-thesis-faq

Doctoral Dissertation

Mcp/sm thesis, thesis and dissertation.

Public housing, Private priorities: The invisible dynamics in low-income housing allocation in urban Peru, the case of CSP-Techo Propio: Fiorella Belli Ferro & Mora Orensanz

Disordering Capital: The Politics of Business in the Business of Water Provision. Isadora Araujo Cruxên

Bridging the Divide Between Qualitative and Quantitative Methods of Gentrification Research Through the Introduction of a Novel Mixed-method in Four U.S. Gayborhoods. Amelia Seabold

Walking to Transit: Using Big Data to Analyze Bus and Train Ridership in Los Angeles. kloe ng

In addition to the traditional monograph (i.e. a book-length manuscript), doctoral students may opt for a three-paper dissertation. 

The three-paper option is based on three related publishable papers and is designed to be used in situations where the thesis material is better suited to three papers on the same general topic rather than turning the dissertation into a book. A dissertation cannot be comprised of essays on three totally separate topics.

The embedded table below shows recent DUSP doctoral dissertation research. For access to PDF copies, please visit MIT Library's Dspace .

The fourth semester as an MCP student is devoted to completing a thesis and rounding out course work leading to graduation. A thesis in the MCP program may take one of several forms: an independent scholarly research project guided by an advisor and readers; a directed thesis contributing to a larger research effort directed by a faculty member; or a professionally oriented thesis developed in the context of a studio or practicum course. In all cases the thesis must be a piece of original, creative work conceived and developed by the student.

The SM is a non-professional degree intended for professionals with a number of years of distinguished practice in city planning or related fields who: have a clear idea of the courses they want to take at MIT, the thesis they want to write and the DUSP faculty member with whom they wish to work.

The embedded table below shows recent DUSP MCP and SM thesis research. For access to PDF copies, please visit MIT Library's Dspace .

Undergraduate students in course 11 and course 11-6 are required to write a senior thesis or complete a senior project. The thesis/project writing process is accompanied by a required undergraduate thesis preparation seminar. 

The embedded table below shows recent DUSP SB thesis research. For access to PDF copies, please visit MIT Library's Dspace .

Graduate Study at SHASS

World-class graduate studies.

SHASS offers five doctoral and four master’s programs.

Doctoral programs

Our top-ranked PhD program sets the standard for graduate economics training across the country. Graduate students work closely with our world-class faculty to develop their own research and prepare to make impactful contributions to the field.

Our doctoral program enrolls 20-24 full-time students each year and students complete their degree in five to six years. Students undertake core coursework in microeconomic theory, macroeconomics, and econometrics, and are expected to complete two major and two minor fields in economics. Beyond the classroom, doctoral students work in close collaboration with faculty to develop their research capabilities, gaining hands-on experience in both theoretical and empirical projects.

Explore PhD program

History, Anthropology, and STS (HASTS)

The doctoral program in History, Anthropology, and Science, Technology, and Society (HASTS) at MIT, founded in 1988, is a unique interdisciplinary academic community devoted to studying the social, cultural, and political life of science and technology. HASTS faculty work with students to develop original scholarship on the historical foundations and contemporary implications of scientific and technological knowledge and practice.

As a culmination of their work, HASTS students complete dissertations that intervene in scholarly and public conversations about the role of science in society. After graduation, students go on to careers in academia, public service, and private industry.

Explore HASTS

Linguistics

Our 5-year PhD program is designed to introduce students to the basic concepts and results of research in generative linguistics, so that they can begin productively contributing to the department’s research activities. We have found that the best way to achieve this goal is for students to work from the very beginning on problems that are relevant to real-life research.

The program is rigorous and quite demanding of students’ time and energy. A high level of commitment and concentration is required to complete it successfully. The program also contains a relatively large number of required courses. We have found that this extra effort pays off in the long run, since students are exposed to a richer mix of research topics and methods. This also means that our students attain a high level of competence in more than one area, and thus qualify for academic and other positions in more than one specialty.

Explore Linguistics

From scallop fishing in New Bedford to deforestation in the tropics, “our goal is to get some empirical traction on the problem,” says Economics PhD student Aaron Berman.

Our program provides subjects and seminars in such traditional areas as logic, ethics, metaphysics, epistemology, philosophy of science, philosophy of language, philosophy of mind, aesthetics, social and political philosophy, and history of philosophy. Interest in philosophical problems arising from other disciplines, such as linguistics, psychology, mathematics and physics, is also encouraged.

Before beginning dissertation research, students are required to take two years of coursework, including a proseminar in contemporary philosophy that all students must complete in their first year of graduate study. Students are also required to write a fifth term pre-dissertation paper and demonstrate competence in the following areas: value theory, logic and the history of philosophy.

Explore Philosophy

Political Science

Our doctoral students are advancing political science as a discipline. They explore the empirical phenomena that produce new scholarly insights—insights that improve the way governments and societies function. As a result, MIT Political Science graduates are sought after for top teaching and research positions in the U.S. and abroad.

The MIT PhD in Political Science requires preparation in two of these major fields: American Politics, Comparative Politics, International Relations, Models and Methods, Political Economy, or Security Studies. We recommend that you take a broad array of courses across your two major fields.

Explore Political Science

Philosophy doctoral student Abe Mathew is both studying philosophy and questioning some of its deeply-held ideas.

Master’s programs

Data, economics, and design of policy.

The international fight against poverty is more data driven than ever before. Producing and understanding rigorous evidence has become increasingly critical for those seeking to affect change globally, but opportunities to acquire these skills remain limited.

As the first master’s program to be offered by MIT’s Department of Economics, the master’s program in Data, Economics, and Design of Policy (DEDP) is designed to meet this rising demand. Jointly run by the Economics Department and the Abdul Latif Jameel Poverty Action Lab (J-PAL ), the program equips development professionals from across the globe with the practical skills and theoretical knowledge needed to tackle some of the world’s most pressing challenges.

Explore Data, Economics, and Design of Policy

MIT Indigenous Language Initiative (Linguistics)

The MIT Indigenous Languages Initiative is a special master’s program in linguistics for members of communities whose languages are threatened. The goal of the program is to provide its graduates with the linguistic knowledge that will help them in efforts to keep their communities’ languages alive.

In addition, the MIT Indigenous Language Initiative offers expanded opportunities for students and faculty to become involved in indigenous and endangered languages. They do this through working with native speaker linguists in the master’s program and also with outside groups.

Explore Indigenous Language Initiative

The MIT Political Science master’s program prepares students to uncover essential insights into the workings of societies and governments in the 21st century. Master’s students develop the skills and knowledge to evaluate and promote effective public policies.

The one-year MIT Master of Science in Political Science is designed for students who want to build proficiency in applied research so that they can pursue successful careers in government, business, and public policy. Students interested in an academic career should read more about the PhD in Political Science.

Science Writing

The MIT Graduate Program in Science Writing (GPSW) is one of the world’s premier master’s programs in science journalism and communication. Set within a community of world-renowned scientists, cutting-edge facilities, and groundbreaking research, our one-year program focuses on introducing students to science communication across a broad range of media, including news and feature reporting, podcasting, data journalism, and documentary film.

During their year here, students learn fundamental research and reporting skills and produce publishable works of print, audio, video, and interactive journalism. Our curriculum teaches students how to interpret and explain science to the wider public, to place research and researchers within their social and historical contexts, and to create pieces that balance hard analysis with creativity and style.

Explore Science Writing

MIT’s Master of Applied Science in Data, Economics, and Design of Policy program adds a public policy track.

More resources

Learn more about MIT graduate studies at the Office of Graduate Education .

Sign up for the SHASS newsletter

Sign up to receive a weekly newsletter with stories about the SHASS community, upcoming events, and our ongoing research.

Fall 2024 Media Arts and Sciences Course List

by Sarra Shubart

Aug. 20, 2024

• Program in Media Arts and Sciences

Share this post

Program in media arts and sciences,  fall 2024.

Full MIT class schedule online at MIT Office of the Registrar

UNDERGRADUATE SUBJECT LISTINGS

MAS.A21 Esvelt Choosing Problems Wisely (0 3 0) W, 1-2:30pm in  E15-359  

MAS.A02 Resnick  Designing Creative Technologies for Kids (0 3 0)        

GRADUATE SUBJECT LISTINGS

MAS.552J Larson City Science (3 0 9) W, 2-5pm in E15-341

MAS.630 Picard  Advanced Seminar: Affective Computing and Ethics  (2 0 10)  W, 10am-12pm in E15-341          

MAS.665J Raskar/Karaman/Agrawal         AI for Impact: Global Ventures (3 0 9) R, 10am-12pm in E14-633       

MAS.750 Breazeal Human-Robot Interaction (2 0 7) Not offered Fall 2023

MAS.809 Dagdeviren Decoders 1.9: Introduction to Microfabrication (3 0 6) W, 10am-12pm in E15-466          

MAS.825J Machover        Musical Aesthetics and Media Technology (3 3 6)    Not offered Fall 2023

MAS.834 Ishii  Tangible Interfaces (3 3 6) T, 1:00-4:00pm in E15-341  

MAS.837 Paradiso Principles of Electronic Music Interfaces (3 0 9) Not offered Fall 2024

MAS.838  Newman/Paige/Hoffman     Prototyping our Sci-Fi Space Future: Designing & Deploying Projects for Zero Gravity Flights (2 2 8) T/R, 10am-12pm in E15-341

MAS.858 Wood  Can Space Enabled Designs Advance Justice and Development? (3 0 9) Not offered Fall 2024           

MAS.863J Gershenfeld    How to Make (Almost) Anything (3 9 6)                      Lecture: W, 1-4pm in E14-633      Recitation: R, 5-7pm in E14-633

MAS.881J (Meets w/ 20.352) Boyden            Principles of Neuroengineering (3 0 9)   T/R, 10:30am-12pm in 46-5165

MAS.883J Boyden/Jacobson/Bonsen Revolutionary Ventures: How to Invent and Deploy Transformative Technologies (2 0 7) R, 2-4 pm in E14-633          

MAS.921* Resnick Proseminar in Media Arts and Sciences (3 0 9) R, 1-3 in  E15-341          

MAS.941* Esvelt   Preparation for SM Thesis II (3 0 6) W, 4-5:30 in E15-341          

Special Topics

MAS.S60  Lieberman Drawing++ T, 11am-1pm in E15-359

MAS.S61  Maes/Shilkrot Generative AI Creative Applications R, 3-5pm  in E15-359

MAS.S62  Sarkar Next-Generation Nanoelectronics and Biotechnology R, 1-3pm in E15-466

MAS.S63 Feldmeier Design for small scale production T, 2-4pm in E15-359

MAS.S90* Resnick/Blanchard Intro to MAS (0 3 0) R, 3-5pm in E15-341          

* indicates subject limited to students enrolled in the MAS program

PhD Thesis Proposal & Critique

Everything you need to know about the Dissertation Proposal for MAS Doctoral Students

Congratulations to the Class of 2018!

Best wishes to the MAS grads

Fall 2018 MAS Course List

Fall is here, hear the yell/Back to school, ring the bell

Spring 2022 Media Arts and Sciences Course List

Classes offered by the Program in Media Arts and Sciences for the Spring 2022 semester

• Request Information
• Find Faculty & Staff
• Industry Partnerships
• Current Students
• Faculty & Staff
• Talent Recruiters
• Search Open Search Close Search
• Message from Dean
• College Leadership
• Quick Facts
• Diversity and Inclusion
• Accreditation
• Faculty & Staff Directory
• Academic Programs
• Academic Departments
• Undergraduate Studies
• Graduate School of Engineering
• Business, Entrepreneurship and Leadership
• Co-op & Experiential Learning
• Clubs & Organizations
• Engineering Computer Center
• Research Centers & Institutes
• Research Facilities
• Publications & Patents
• Industry Partnership
• Student Research
• Honors & Distinctions
• Annual Reports
• Faculty Hiring
• In the Media
• Spotlight Stories

« All Events

• This event has passed.

Kyle Lockwood PhD Dissertation Defense

July 30, 2024 @ 1:30 pm - 2:30 pm.

Name: Kyle Lockwood

Title: Leveraging Submovements for Prediction and Trajectory Planning in  Human-Robot Handover

Date: 7/30/2024

Time: 1:30:00 PM

Location: ISEC 532 –

Committee Members: Prof. Deniz Erdogmus (Advisor) Prof. Eugene Tunik (Co-Advisor) Prof. Mathew Yarossi Prof. Tales Imbiriba

Abstract: Collaborative physical interactions between humans and robots pose difficult modeling challenges. To create natural interactions, engineers must consider human inference of intent, anticipation of action, and coordination of movement. Humans can handle these challenges effortlessly when interacting with one another, but they are very difficult to overcome in robot implementations. Although human-human handover is a seemingly simple task, it requires a complex perception-action coupling to determine when and where the handover will happen, as well as choosing an appropriate trajectory to receive the object. Critically, modeling human-robot handover requires incorporating knowledge about human inference and trajectory planning to obtain seamless interactions. Despite recent advancements in sensing and control, human-robot handovers are far from approaching the fluidity and flexibility of human-human collaboration. Existing predictive models applied to human-robot handover often utilize classification methods and other approaches that suffer in accuracy when encountering noisy human trajectories that are not captured during their training. To address these challenges, this work presents two models that act as robotic surrogates for human inference and trajectory planning in a handover task. This approach delivers promising results while remaining grounded in a physiologically meaningful feature of human motion: Gaussian-shaped submovements in velocity profiles. This thesis analyzes human-human handover kinematics to establish a baseline for model evaluation and investigate the influence of handover role, it presents models for human inference and trajectory planning, and it applies the inference model in human-robot handover experiments.