<?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-22T12:10:29Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/4666" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/4666</identifier><datestamp>2017-03-21T16:39:44Z</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="d57c186c-bdcd-4cbd-8b52-1acaf00d89dd" confidence="600">Pearson, James Ross</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2009-09-01T14:29:04Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2009-09-01T14:29:04Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2009-09-01T14:29:04Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2009</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/4666</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">Zip.ca is an online DVD rental company that faces two major operational problems:&#xd;
calculation of the assignment of DVDs to customers every thirty minutes&#xd;
throughout the day and purchasing of new inventory in regular intervals.&#xd;
&#xd;
In this thesis, we model these two problems and develop algorithms to solve&#xd;
them. In doing so, we encounter many theoretical problems that are both applicable&#xd;
to Zip’s operations and intrinsically interesting problems independent of the&#xd;
application.&#xd;
&#xd;
First, we note that the assignment problem facing Zip is inherently in an online&#xd;
setting. With returns of DVDs being processed throughout the day, the dataset&#xd;
is constantly changing. Although the ideal solution would be to wait until the&#xd;
end of the day to make decisions, physical work load capacities prevent this. For&#xd;
this reason we discuss two online problems, online 0-1 budgeted matching and&#xd;
the budgeted Adwords auction. We present a 1/(2 w_max/w_min)-competitive algorithm for the online 0-1 budgeted matching problem, and prove that this is the best possible&#xd;
competitive ratio possible for a wide class of algorithms. We also give a (1− (S+1)/(S+e) )-competitive algorithm for the budgeted Adwords auction as the size of the bids&#xd;
and cost get small compared to the budgets, where S is the ratio of the highest and&#xd;
lowest ratios of bids to costs.&#xd;
&#xd;
We suggest a linear programming approach to solve Zip’s assignment problem.&#xd;
We develop an integer program that models the B-matching instance with additional&#xd;
constraints of concern to Zip, and prove that this integer program belongs to&#xd;
a larger class of integer programs that has totally unimodular constraint matrices.&#xd;
Thus, the assignment problem can be solved to optimality every thirty minutes.&#xd;
We additionally create a test environment to check daily performance, and provide&#xd;
real-time implementation results, showing a marked improvement over Zip’s old&#xd;
algorithm.&#xd;
&#xd;
We show that Zip’s purchasing problem can be modeled by the matching augmentation&#xd;
problem defined as follows. Given a graph with vertex capacities and&#xd;
costs, edge weights, and budget C, find a purchasing of additional node capacity of&#xd;
cost at most C that admits a B-matching of maximum weight. We give a PTAS for&#xd;
this problem, and then present a special case that is polynomial time solvable that&#xd;
still models Zip’s purchasing problem, under the assumption of uniform costs.&#xd;
&#xd;
We then extend the augmentation idea to matroids and present matroid augmentation,&#xd;
matroid knapsack, and matroid intersection knapsack, three NP-hard&#xd;
problems. We give an FPTAS for matroid knapsack by dynamic programming,&#xd;
PTASes for the other two, and demonstrate applications of these problems.</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">Budgeted Optimization</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">DVD Assignment</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">Exact, Approximate, and Online Algorithms for Optimization Problems Arising in DVD Assignment</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>