Browsing by Subject "combinatorial optimization"

Now showing items 1-5 of 5

    • Adaptable Long-Term Optimization of Dry Cask Storage Loading Patterns 
      Spencer, Kristina Yancey (2017-11-07)
      To address the evolving needs of dry storage, this research developed an optimization methodology to identify loading configurations to minimize the number of casks, their heat load, and the time when they meet transportation ...
    • Graph theoretic generalizations of clique: optimization and extensions 
      Balasundaram, Balabhaskar (2009-05-15)
      This dissertation considers graph theoretic generalizations of the maximum clique problem. Models that were originally proposed in social network analysis literature, are investigated from a mathematical programming ...
    • A new polyhedral approach to combinatorial designs 
      Arambula Mercado, Ivette (Texas A&M University, 2004-09-30)
      We consider combinatorial t-design problems as discrete optimization problems. Our motivation is that only a few studies have been done on the use of exact optimization techniques in designs, and that classical methods in ...
    • Parameterized Approaches for Large-Scale Optimization Problems 
      Buchanan, Austin Loyd (2015-07-10)
      In this dissertation, we study challenging discrete optimization problems from the perspective of parameterized complexity. The usefulness of this type of analysis is twofold. First, it can lead to efficient algorithms for ...
    • The Slim Branch and Price Method with an Application to the Hamiltonian p-median Problem 
      Marzouk, Ahmed Mohamed Badr Aly (2016-10-06)
      The main objective of this dissertation is to present a new exact optimization method, the Slim Branch and Price (SBP) method, which is an improvement over the traditional Branch and Price (B&P) framework. SBP can be used ...