<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-22T11:32:23Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/3283" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/3283</identifier><datestamp>2017-03-21T16:23:30Z</datestamp><setSpec>com_10012_9924</setSpec><setSpec>com_10012_1</setSpec><setSpec>col_10012_9928</setSpec><setSpec>col_10012_6</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="author" authority="1d499b25-f44e-488e-9e8e-7c15560168e9" confidence="600">Zvereva, Margarita</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2007-09-24T15:01:59Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2007-09-24T15:01:59Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2007-09-24T15:01:59Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2007</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/3283</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">The facility location problem is the task of optimally placing a&#xd;
given number of facilities in a certain subset of the plane.  In&#xd;
this thesis, we present  various mathematical programming&#xd;
formulations of the planar facility location problem, where&#xd;
potential facility locations are not specified. We first consider&#xd;
mixed-integer programming formulations of the planar facility&#xd;
locations problems with squared Euclidean and rectangular distance&#xd;
metrics to solve this problem to provable optimality. We also&#xd;
investigate a heuristic approach to solving the problem by extending&#xd;
the $K$-means clustering algorithm and formulating the facility&#xd;
location problem as a variant of a semidefinite programming problem,&#xd;
leading to a relaxation algorithm. We present computational results&#xd;
for the mixed-integer formulations, as well as compare the objective&#xd;
values resulting from the relaxation algorithm and the modified&#xd;
$K$-means heuristic.  In addition, we briefly discuss some of the&#xd;
practical issues related to the facility location model under the&#xd;
continuous customer distribution.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en">en</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">facility location</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">semidefinite programming</dim:field>
   <dim:field mdschema="dc" element="subject" qualifier="program" lang="en">Combinatorics and Optimization</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">Mathematical Programming Formulations of the Planar Facility Location Problem</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Master Thesis</dim:field>
   <dim:field mdschema="dc" element="pending" lang="en">false</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="department" lang="en">Combinatorics and Optimization</dim:field>
   <dim:field mdschema="uws-etd" element="degree" lang="en">Master of Mathematics</dim:field>
   <dim:field mdschema="uws" element="typeOfResource" lang="en">Text</dim:field>
   <dim:field mdschema="uws" element="peerReviewStatus" lang="en">Unreviewed</dim:field>
   <dim:field mdschema="uws" element="scholarLevel" lang="en">Graduate</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>