Browsing by Subject "integer programming"
Now showing items 1-6 of 6
-
(Texas A&M University, 2006-04-12)We propose a novel branch-and-price (B&P) approach to solve the maximum weighted independent set problem (MWISP). Our approach uses clones of vertices to create edge-disjoint partitions from vertex-disjoint partitions. We ...
-
(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 ...
-
(2017-07-26)This thesis develops network-based approaches to analysis and optimization of wind energy systems. The wind energy system is a complex system that produces a massive amount of wind speed data over time, characterized by ...
-
(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 ...
-
(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 ...
-
(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 ...