Advanced Search
Your query "((degree:Doctoral) AND (department:"Operations Research"))" produced 20 result(s).
Search Results for Community: Theses and Dissertations (ETDs)
-
Baker, Steven F.
(Monterey, California. Naval Postgraduate School, 1997)
We develop a method to approximately solve a large staircase linear program that optimizes decisions over time. Also developed is a method to bound that approximation's error. A feasible solution is derived by a proximal ...
-
Appleget, Jeffrey A.
(Monterey, California. Naval Postgraduate School, 1997)
Enhanced solution techniques are developed for solving integer programs (IPs) and mixed-integer programs (MIPs). Previously unsolvable problems can be solved with these new techniques. We develop knapsack cut-finding ...
-
Israeli, Eitan
(Monterey, California. Naval Postgraduate School, 1999-03-01)
We study the problem of interdicting components of an adversary's system, e.g., a war-time economy, a transportation network, etc. Basic techniques are developed and illustrated with a simple network interdiction problem, ...
-
Ayik, Mehmet
(Monterey, California. Naval Postgraduate School, 2000)
The Set Partitioning Problem (SPP) is one of the most extensively researched models in integer optimization, and is widely applied in operations research. SPP is used for crew scheduling, vehicle routing, stock cutting, ...
-
Kobayashi, Izumi
(Monterey, California. Naval Postgraduate School, 2002-09)
We propose two methods of constructing ensembles of classifiers. One method directly injects randomness into classification tree algorithms by choosing a split randomly at each node with probabilities proportional to the ...
-
Cioppa, Thomas M.
(Monterey, California. Naval Postgraduate School, 2002-09)
The Department of Defense uses complex high-dimensional simulation models as an important tool in its decision-making process. To improve on the ability to efficiently explore larger subspaces of these models, this ...
-
Martins, Gustavo H. A.
(2003-06)
This dissertation investigates Multidimensional Packing Problems (MD-PPs): the Pallet Loading Problem (PLP), the Multidimensional Knapsack Problem (MD-KP), and the Multidimensional Bin Packing Problem (MD-BPP). In these ...
-
Silva, Eduardo Ferreira
(Monterey, California. Naval Postgraduate School, 2004., 2004-09)
The first phase of this research demonstrates improvements in the performance of branch-and-price algorithms (B and P) for solving integer programs by (i) stabilizing dual variables during column generation, (ii) performing ...
-
Avital, Ittai
(Monterey, California. Naval Postgraduate School, 2005-03)
We model the problem of minimum-cost procurement and allocation of anti-ship cruise missiles to naval combat ships as a two-period chance-constrained program with recourse. Discrete scenarios in two periods define "demands" ...
-
Hernandez, Alejandro S.
(Monterey California. Naval Postgraduate School, 2008-12)
A dynamic and extremely complex landscape in security and world events presents problems that challenge all sectors of society to develop efficient means for exploring a wide range of solutions. Similarly, exponential ...