Browsing Operations Research Center by Title
Research and Teaching Output of the MIT Community
- Home
- →
- Operations Research Center
- →
- Browsing Operations Research Center by Title
JavaScript is disabled for your browser. Some features of this site may not work without it.
Browsing Operations Research Center by Title
-
(Massachusetts Institute of Technology, 2003)We present a Lagrangian based approach to decoupling weakly coupled dynamic optimization problems for both finite and infinite horizon problems. The main contributions of this dissertation are: (i) We develop methods for ...
-
(Massachusetts Institute of Technology, 2013)Public transportation is undeniably an effective way to move a large number of people in a city. Its ineffectiveness, such as long travel times, poor coverage, and lack of direct services, however, makes it unappealing to ...
-
(Massachusetts Institute of Technology, 2007)With recent advances in research and technology, autonomous surface vessel capabilities have steadily increased. These autonomous surface vessel technologies enable missions and tasks to be performed without the direction ...
-
(Massachusetts Institute of Technology, Operations Research Center, 1985)
-
(Massachusetts Institute of Technology, Operations Research Center, 1985)
-
(Massachusetts Institute of Technology, 2013)Over 90% of the data available across the world has been produced over the last two years, and the trend is increasing. It has therefore become paramount to develop algorithms which are able to scale to very high dimensions. ...
-
(Massachusetts Institute of Technology, 2011)Parallel server queues are a family of stochastic models useful in a variety of applications, including service systems and telecommunication networks. A particular application that has received considerable attention in ...
-
Lead Time Distribution of Three-Machine Two-Buffer Lines with Unreliable Machines and Finite Buffers (Massachusetts Institute of Technology, Operations Research Center, 2016-08-23)
-
(Massachusetts Institute of Technology, Operations Research Center, 2012-08-29)
-
(Massachusetts Institute of Technology, 2004)There is a great need among educators for a way to quickly assign teams in large or distance learning classrooms in a manner superior to random assignment or student self-selection. Forming teams based on knowledge of ...
-
(Massachusetts Institute of Technology, 2018)This thesis addresses several prediction and estimation problems under structured decision constraints. We consider them in two parts below. Part 1 focuses on supervised learning problems with constrained output spaces. ...
-
(Massachusetts Institute of Technology, Operations Research Center, 1973-04)Linear approximation and linear programming duality theory are used as unifying tools to develop saddlepoint, Fenchel and local duality theory. Among results presented is a new and elementary proof of the necessity and ...
-
(Massachusetts Institute of Technology, Operations Research Center, 1983)
-
(Massachusetts Institute of Technology, 1985)
-
(Massachusetts Institute of Technology, 1998)
-
(Massachusetts Institute of Technology, 2004)(cont.) Extensions to the core TOTEM model include a demand charge model, used for making daily optimal control decisions when the electric bill includes a charge based on the monthly maximum power draw. The problem of ...
-
(Massachusetts Institute of Technology, Operations Research Center, 1992-11)Discretionary service facilities are providers of products and/or services that are purchased by customers who are traveling on otherwise pre-planned trips such as the daily commute. Optimum location of such facilities ...
-
(Massachusetts Institute of Technology, Operations Research Center, 1978-10)The median problem has been generalized to the case in which facilities can be moved, at a cost, on the network in response to changes in the state of the network. Such changes are brought about by changes in travel times ...
-
(Massachusetts Institute of Technology, Operations Research Center, 1985-01)We consider a two-person zero-sum game in which the maximizer selects a point in a given bounded planar region, the minimizer selects K points in that region,.and the payoff is the distance from the maximizer's location ...
-
(Massachusetts Institute of Technology, Operations Research Center, 1974)
Browse
My Account
MIT-Mirage