Exact and Heuristic Algorithms for the q-mode Problem
| dc.contributor.advisor | Stephen Roberts, Committee Member | en_US |
| dc.contributor.advisor | Shu-Cherng Fang, Committee Member | en_US |
| dc.contributor.advisor | Carla Savage, Committee Member | en_US |
| dc.contributor.advisor | Yahya Fathi, Committee Chair | en_US |
| dc.contributor.author | Kulkarni, Girish | en_US |
| dc.date.accessioned | 2010-04-02T18:29:52Z | |
| dc.date.available | 2010-04-02T18:29:52Z | |
| dc.date.issued | 2005-05-18 | en_US |
| dc.degree.discipline | Operations Research | en_US |
| dc.degree.level | dissertation | en_US |
| dc.degree.name | PhD | en_US |
| dc.description.abstract | In this dissertation we focus on the development of exact and inexact (i.e., heuristic) algorithms for the q-mode problem. The exact algorithms are based on integer programming models for the q-mode problem. We discuss the theoretical properties of an existing IP model and propose several enhancements. We also propose a new IP model for the problem and investigate these models through a comprehensive computational experiment. The experiment reveals that, in practice, the IP models are more effective for instances with strong natural clusters but less effective for instances containing weak natural clusters. We also propose exact algorithms based on the Benders decomposition for one of the IP models. The heuristic algorithm that we propose for the q-mode problem is a local improvement algorithm that is based on a very large scale neighborhood structure. We evaluate the algorithm through a computational experiment and empirically demonstrate its effectiveness. | en_US |
| dc.identifier.other | etd-05122005-171458 | en_US |
| dc.identifier.uri | http://www.lib.ncsu.edu/resolver/1840.16/3416 | |
| dc.rights | I hereby certify that, if appropriate, I have obtained and attached hereto a written permission statement from the owner(s) of each third party copyrighted matter to be included in my thesis, dissertation, or project report, allowing distribution as specified below. I certify that the version I submitted is the same as that approved by my advisory committee. I hereby grant to NC State University or its agents the non-exclusive license to archive and make accessible, under the conditions specified below, my thesis, dissertation, or project report in whole or in part in all forms of media, now or hereafter known. I retain all other ownership rights to the copyright of the thesis, dissertation or project report. I also retain the right to use in future works (such as articles or books) all or part of this thesis, dissertation, or project report. | en_US |
| dc.subject | clustering categorical data | en_US |
| dc.subject | combinatorial optimisation | en_US |
| dc.subject | mixed integer programming | en_US |
| dc.subject | neighborhood search | en_US |
| dc.subject | very large scale neighborhood | en_US |
| dc.title | Exact and Heuristic Algorithms for the q-mode Problem | en_US |
Files
Original bundle
1 - 1 of 1
