Matches in SemOpenAlex for { <https://semopenalex.org/work/W584283033> ?p ?o ?g. }
- W584283033 abstract "Zip.ca is an online DVD rental company that faces two major operational problems: calculation of the assignment of DVDs to customers every thirty minutes throughout the day and purchasing of new inventory in regular intervals. In this thesis, we model these two problems and develop algorithms to solve them. In doing so, we encounter many theoretical problems that are both applicable to Zip’s operations and intrinsically interesting problems independent of the application. First, we note that the assignment problem facing Zip is inherently in an online setting. With returns of DVDs being processed throughout the day, the dataset is constantly changing. Although the ideal solution would be to wait until the end of the day to make decisions, physical work load capacities prevent this. For this reason we discuss two online problems, online 0-1 budgeted matching and the budgeted Adwords auction. We present a 1 2 wmax wmin -competitive algorithm for the online 0-1 budgeted matching problem, and prove that this is the best possible 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 and cost get small compared to the budgets, where S is the ratio of the highest and lowest ratios of bids to costs. We suggest a linear programming approach to solve Zip’s assignment problem. We develop an integer program that models the B-matching instance with additional constraints of concern to Zip, and prove that this integer program belongs to a larger class of integer programs that has totally unimodular constraint matrices. Thus, the assignment problem can be solved to optimality every thirty minutes. We additionally create a test environment to check daily performance, and provide real-time implementation results, showing a marked improvement over Zip’s old algorithm. We show that Zip’s purchasing problem can be modeled by the matching augmentation problem defined as follows. Given a graph with vertex capacities and costs, edge weights, and budget C, find a purchasing of additional node capacity of cost at most C that admits a B-matching of maximum weight. We give a PTAS for this problem, and then present a special case that is polynomial time solvable that still models Zip’s purchasing problem, under the assumption of uniform costs. We then extend the augmentation idea to matroids and present matroid augmentation, matroid knapsack, and matroid intersection knapsack, three NP-hard problems. We give an FPTAS for matroid knapsack by dynamic programming, PTASes for the other two, and demonstrate applications of these problems." @default.
- W584283033 created "2016-06-24" @default.
- W584283033 creator A5059470594 @default.
- W584283033 date "2009-09-01" @default.
- W584283033 modified "2023-09-28" @default.
- W584283033 title "Exact, Approximate, and Online Algorithms for Optimization Problems Arising in DVD Assignment" @default.
- W584283033 cites W1576317141 @default.
- W584283033 cites W1928381443 @default.
- W584283033 cites W1963547452 @default.
- W584283033 cites W1964119857 @default.
- W584283033 cites W1965680834 @default.
- W584283033 cites W1981234161 @default.
- W584283033 cites W2011039300 @default.
- W584283033 cites W2026891055 @default.
- W584283033 cites W2027029507 @default.
- W584283033 cites W2044935944 @default.
- W584283033 cites W2048837158 @default.
- W584283033 cites W2063245286 @default.
- W584283033 cites W2097509673 @default.
- W584283033 cites W2111741734 @default.
- W584283033 cites W2131951207 @default.
- W584283033 cites W2142339200 @default.
- W584283033 cites W2162656786 @default.
- W584283033 cites W2327315803 @default.
- W584283033 cites W2340149117 @default.
- W584283033 cites W3044238769 @default.
- W584283033 cites W86044744 @default.
- W584283033 cites W2002252750 @default.
- W584283033 hasPublicationYear "2009" @default.
- W584283033 type Work @default.
- W584283033 sameAs 584283033 @default.
- W584283033 citedByCount "0" @default.
- W584283033 crossrefType "dissertation" @default.
- W584283033 hasAuthorship W584283033A5059470594 @default.
- W584283033 hasConcept C102408133 @default.
- W584283033 hasConcept C105795698 @default.
- W584283033 hasConcept C11413529 @default.
- W584283033 hasConcept C126255220 @default.
- W584283033 hasConcept C127413603 @default.
- W584283033 hasConcept C134306372 @default.
- W584283033 hasConcept C147176958 @default.
- W584283033 hasConcept C154945302 @default.
- W584283033 hasConcept C165064840 @default.
- W584283033 hasConcept C194146004 @default.
- W584283033 hasConcept C196921405 @default.
- W584283033 hasConcept C199360897 @default.
- W584283033 hasConcept C21547014 @default.
- W584283033 hasConcept C2777212361 @default.
- W584283033 hasConcept C2778813691 @default.
- W584283033 hasConcept C33923547 @default.
- W584283033 hasConcept C41008148 @default.
- W584283033 hasConcept C42475967 @default.
- W584283033 hasConcept C56086750 @default.
- W584283033 hasConcept C77553402 @default.
- W584283033 hasConcept C85044808 @default.
- W584283033 hasConcept C85502023 @default.
- W584283033 hasConcept C97137487 @default.
- W584283033 hasConceptScore W584283033C102408133 @default.
- W584283033 hasConceptScore W584283033C105795698 @default.
- W584283033 hasConceptScore W584283033C11413529 @default.
- W584283033 hasConceptScore W584283033C126255220 @default.
- W584283033 hasConceptScore W584283033C127413603 @default.
- W584283033 hasConceptScore W584283033C134306372 @default.
- W584283033 hasConceptScore W584283033C147176958 @default.
- W584283033 hasConceptScore W584283033C154945302 @default.
- W584283033 hasConceptScore W584283033C165064840 @default.
- W584283033 hasConceptScore W584283033C194146004 @default.
- W584283033 hasConceptScore W584283033C196921405 @default.
- W584283033 hasConceptScore W584283033C199360897 @default.
- W584283033 hasConceptScore W584283033C21547014 @default.
- W584283033 hasConceptScore W584283033C2777212361 @default.
- W584283033 hasConceptScore W584283033C2778813691 @default.
- W584283033 hasConceptScore W584283033C33923547 @default.
- W584283033 hasConceptScore W584283033C41008148 @default.
- W584283033 hasConceptScore W584283033C42475967 @default.
- W584283033 hasConceptScore W584283033C56086750 @default.
- W584283033 hasConceptScore W584283033C77553402 @default.
- W584283033 hasConceptScore W584283033C85044808 @default.
- W584283033 hasConceptScore W584283033C85502023 @default.
- W584283033 hasConceptScore W584283033C97137487 @default.
- W584283033 hasLocation W5842830331 @default.
- W584283033 hasOpenAccess W584283033 @default.
- W584283033 hasPrimaryLocation W5842830331 @default.
- W584283033 hasRelatedWork W155400107 @default.
- W584283033 hasRelatedWork W1796542900 @default.
- W584283033 hasRelatedWork W1937970425 @default.
- W584283033 hasRelatedWork W1985993746 @default.
- W584283033 hasRelatedWork W2010839239 @default.
- W584283033 hasRelatedWork W2011087880 @default.
- W584283033 hasRelatedWork W2020570543 @default.
- W584283033 hasRelatedWork W2063271536 @default.
- W584283033 hasRelatedWork W2084931472 @default.
- W584283033 hasRelatedWork W2159070416 @default.
- W584283033 hasRelatedWork W2311097448 @default.
- W584283033 hasRelatedWork W2332825004 @default.
- W584283033 hasRelatedWork W2380342309 @default.
- W584283033 hasRelatedWork W2593165862 @default.
- W584283033 hasRelatedWork W2618915936 @default.
- W584283033 hasRelatedWork W3004260102 @default.
- W584283033 hasRelatedWork W3040421639 @default.