{"id":{"repo_id":"mcmaster","oai_identifier":"oai:macsphere.mcmaster.ca:11375/8396"},"canonical_url":"https://search.ndltd.org/etd/mcmaster/oai:macsphere.mcmaster.ca:11375/8396","repository":{"repo_id":"mcmaster","name":"McMaster University","base_url":"https://macsphere.mcmaster.ca/server/oai/request"},"display":{"title":"New solution algorithms for the classification problem","abstract":"<p>This thesis proposes a new mixed integer programming model of the two group classification problem. A branch-and-bound procedure is designed to solve the mixed integer programming model. The proposed procedure is more efficient than recently published procedures in the literature. Three heuristics are also designed from the branch-and- bound procedure. The Three Seed and N Seed heuristics provide solutions that are \"close\" to the optimal solution for substantially less computational effort. This thesis also proposes a quadratic transformation method which provides a solution that is competitive with the classical quadratic discriminant analysis method.</p>","abstract_html":"&lt;p&gt;This thesis proposes a new mixed integer programming model of the two group classification problem. A branch-and-bound procedure is designed to solve the mixed integer programming model. The proposed procedure is more efficient than recently published procedures in the literature. Three heuristics are also designed from the branch-and- bound procedure. The Three Seed and N Seed heuristics provide solutions that are &quot;close&quot; to the optimal solution for substantially less computational effort. This thesis also proposes a quadratic transformation method which provides a solution that is competitive with the classical quadratic discriminant analysis method.&lt;/p&gt;","abstract_has_math":false,"creators":["Banks, James William"],"institution":null,"degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Business Administration","school":null,"contributors":[],"advisors":["Abad, Prakash L."],"committee_chairs":[],"committee_members":[],"year":1991,"date_issued":"1991-10","date_published":"1991-10","updated_at":"2026-11-18T19:33:44Z","subjects":["Business Administration, Management, and Operations"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://doi.org/10.71548/14831"],"render_values":[{"text":"https://doi.org/10.71548/14831","href":"https://doi.org/10.71548/14831","code":true}]},{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["opendissertations/3603","4620","1668344"],"render_values":[{"text":"opendissertations/3603","href":null,"code":true},{"text":"4620","href":null,"code":true},{"text":"1668344","href":null,"code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/11375/8396","outbound_label":"Handle","outbound_source":"dc:identifier.uri","record_url":"http://hdl.handle.net/11375/8396","record_label":"Repository record","record_kind":"handle","record_source":"dc:identifier.uri","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://macsphere.mcmaster.ca/server/oai/request?verb=GetRecord&metadataPrefix=dim&identifier=oai%3Amacsphere.mcmaster.ca%3A11375%2F8396","prefix":"dim"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Abad, Prakash L."]},{"key":"dc:contributor.department","label":"Department","values":["Business Administration"]},{"key":"dc:creator","label":"Author","values":["Banks, James William"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2014-06-18T16:42:48Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2014-06-18T16:42:48Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["2010-12-01"]},{"key":"dc:date.issued","label":"Date","values":["1991-10"]},{"key":"dc:type","label":"Dc Type","values":["thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Business Administration, Management, and Operations"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["opendissertations/3603","4620","1668344"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/11375/8396","https://doi.org/10.71548/14831"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["<p>This thesis proposes a new mixed integer programming model of the two group classification problem. A branch-and-bound procedure is designed to solve the mixed integer programming model. The proposed procedure is more efficient than recently published procedures in the literature. Three heuristics are also designed from the branch-and- bound procedure. The Three Seed and N Seed heuristics provide solutions that are \"close\" to the optimal solution for substantially less computational effort. This thesis also proposes a quadratic transformation method which provides a solution that is competitive with the classical quadratic discriminant analysis method.</p>"]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["Doctor of Philosophy (PhD)"]},{"key":"dc:title","label":"Title","values":["New solution algorithms for the classification problem"]},{"key":"others:access_status","label":"Others Access Status","values":["open.access"]}]}],"canonical_facts":{"dc:contributor.advisor":["Abad, Prakash L."],"dc:contributor.department":["Business Administration"],"dc:creator":["Banks, James William"],"dc:date.accessioned":["2014-06-18T16:42:48Z"],"dc:date.available":["2014-06-18T16:42:48Z"],"dc:date.created":["2010-12-01"],"dc:date.issued":["1991-10"],"dc:description.abstract":["<p>This thesis proposes a new mixed integer programming model of the two group classification problem. A branch-and-bound procedure is designed to solve the mixed integer programming model. The proposed procedure is more efficient than recently published procedures in the literature. Three heuristics are also designed from the branch-and- bound procedure. The Three Seed and N Seed heuristics provide solutions that are \"close\" to the optimal solution for substantially less computational effort. This thesis also proposes a quadratic transformation method which provides a solution that is competitive with the classical quadratic discriminant analysis method.</p>"],"dc:description.degree":["Doctor of Philosophy (PhD)"],"dc:identifier.other":["opendissertations/3603","4620","1668344"],"dc:identifier.uri":["http://hdl.handle.net/11375/8396","https://doi.org/10.71548/14831"],"dc:subject":["Business Administration, Management, and Operations"],"dc:title":["New solution algorithms for the classification problem"],"dc:type":["thesis"],"others:access_status":["open.access"]},"updated_at":"2026-11-18T19:33:44Z"}