In this thesis we explore modeling alternatives for the graph k-clustering problem. For k ≥ 2, the problem is to find a minimum cost partition of k connected subgraphs of a graph G=(V, E). We used the AMPL modeling framework to develop both a Mixed Integer Linear Programming model that uses a multi-commodity formulation and a column generation procedure that uses a restricted master problem and generates variables by solving a Pricing problem.
|Advisor:||Belotti, Pietro, Terlaky, Tamas|
|School Location:||United States -- Pennsylvania|
|Source:||MAI 49/03M, Masters Abstracts International|
|Subjects:||Industrial engineering, Operations research|
|Keywords:||Clustering, Clustering problem, Column generation, Connected graph, K-clustering, Partitioning|
Copyright in each Dissertation and Thesis is retained by the author. All Rights Reserved
dissertation or thesis. The supplemental files are provided "AS IS" without warranty. ProQuest is not responsible for the
content, format or impact on the supplemental file(s) on our system. in some cases, the file type may be unknown or
may be a .exe file. We recommend caution as you open such files.
supplemental files is subject to the ProQuest Terms and Conditions of use.