<?xml version='1.0' encoding='UTF-8'?><?xml-stylesheet href='static/style.xsl' type='text/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-22T08:47:22Z</responseDate><request verb="GetRecord" identifier="oai:ecommons.cornell.edu:1813/67280" metadataPrefix="dim">https://ecommons.cornell.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:ecommons.cornell.edu:1813/67280</identifier><datestamp>2026-05-15T19:44:30Z</datestamp><setSpec>com_1813_35</setSpec><setSpec>col_1813_47</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="author">Lo, Venus Hiu Ling</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="chair">Topaloglu, Huseyin</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="committeeMember">Iyer, Krishnamurthy</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="committeeMember">Banerjee, Siddhartha</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2019-10-15T15:28:59Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2019-10-15T15:28:59Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2019-05-30</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="other">ProQuest Submission ID: 11428</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="other">ProQuest Publication ID: 13882813</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://hdl.handle.net/1813/67280</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="doi">https://doi.org/10.7298/qkxf-d595</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="bibid">11050262</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract">We study three assortment optimization problems that reflect the current retail environment.  The goal of these problems is to compute an assortment which maximizes the retailer’s expected revenue or profit, depending on the scenario.  For each problem, we present efficient algorithms to compute the optimal assortment, or prove that the problem is NP-hard and provide an approximation algorithm.  First, we study assortment optimization for an omnichannel retailer, who operates both an online store and a physical store offline.  The retailer selects a subset of products from the online store to offer in the physical store, knowing that customers can visit the physical store to observe products and update preferences for similar products offered online.  We introduce a features tree to organize products by their shared features, and describe how customers update their preferences for online products.  Second, we study assortment optimization when certain products look more attractive if they are offered alongside in the assortment.  For example, by observing a lower quality product, customers may perceive an increase in value for a target product.  We call this effect synergy and introduce a synergy graph to describe the synergy structure between products.  We classify the difficulty of the synergistic assortment optimization problem based on the synergy graph.  Finally, we study assortment optimization with dynamic substitution and inventory stocking costs.  This problem considers customers who arrive over a finite selling horizon to make a purchasing decision amongst the products that have not stocked-out.  The retailer does not have the ability to modify the assortment seen by each arriving customer.  Hence, the assortment that each customer purchases from depends on the initial assortment and stocking decisions of the retailer, as well as the purchasing decisions of the preceding customers.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso">en_US</dim:field>
   <dim:field mdschema="dc" element="subject">Operations research</dim:field>
   <dim:field mdschema="dc" element="subject">assortment optimization</dim:field>
   <dim:field mdschema="dc" element="subject">revenue management</dim:field>
   <dim:field mdschema="dc" element="title">Capturing Product Complementarity in Assortment Optimization</dim:field>
   <dim:field mdschema="dc" element="type">dissertation or thesis</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="discipline">Operations Research and Information Engineering</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="grantor">Cornell University</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="level">Doctor of Philosophy</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="name">Ph.D., Operations Research and Information Engineering</dim:field>
   <dim:field mdschema="dcterms" element="license">https://hdl.handle.net/1813/59810</dim:field>
   <dim:field mdschema="dspace" element="entity" qualifier="type">Publication</dim:field>
   <dim:field mdschema="cris" element="virtual" qualifier="collection" authority="https://cornell-ecommons.eks.prod.4science.cloud/handle/1813/47" confidence="600">Cornell Theses and Dissertations</dim:field>
   <dim:field mdschema="cris" element="virtual" qualifier="author">Lo, Venus Hiu Ling</dim:field>
   <dim:field mdschema="cris" element="virtualsource" qualifier="collection">5893a6ea-7af3-41d7-abc6-04bcd26ab5df</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
   <dim:field mdschema="cerif" element="openaire" authority="" confidence="-1">&lt;Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="4a9cd74f-9201-4df9-a624-12d0f2de178b">
	&lt;Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843&lt;/Type>
	&lt;Language>en_US&lt;/Language>
   	&lt;Title>Capturing Product Complementarity in Assortment Optimization&lt;/Title>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2019-05-30&lt;/PublicationDate>
   	&lt;DOI>https://doi.org/10.7298/qkxf-d595&lt;/DOI>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Lo, Venus Hiu Ling&lt;/DisplayName>
         	&lt;Affiliation>
         		&lt;OrgUnit>
         		&lt;/OrgUnit>
         	&lt;/Affiliation>
      	&lt;/Author>
	&lt;/Authors>
   	&lt;Editors>
	&lt;/Editors>
    &lt;Publishers>
        &lt;Publisher>
            &lt;OrgUnit />
        &lt;/Publisher>
    &lt;/Publishers>
    &lt;Keyword>Operations research&lt;/Keyword>
    &lt;Keyword>assortment optimization&lt;/Keyword>
    &lt;Keyword>revenue management&lt;/Keyword>
   	&lt;Abstract>We study three assortment optimization problems that reflect the current retail environment.  The goal of these problems is to compute an assortment which maximizes the retailer’s expected revenue or profit, depending on the scenario.  For each problem, we present efficient algorithms to compute the optimal assortment, or prove that the problem is NP-hard and provide an approximation algorithm.  First, we study assortment optimization for an omnichannel retailer, who operates both an online store and a physical store offline.  The retailer selects a subset of products from the online store to offer in the physical store, knowing that customers can visit the physical store to observe products and update preferences for similar products offered online.  We introduce a features tree to organize products by their shared features, and describe how customers update their preferences for online products.  Second, we study assortment optimization when certain products look more attractive if they are offered alongside in the assortment.  For example, by observing a lower quality product, customers may perceive an increase in value for a target product.  We call this effect synergy and introduce a synergy graph to describe the synergy structure between products.  We classify the difficulty of the synergistic assortment optimization problem based on the synergy graph.  Finally, we study assortment optimization with dynamic substitution and inventory stocking costs.  This problem considers customers who arrive over a finite selling horizon to make a purchasing decision amongst the products that have not stocked-out.  The retailer does not have the ability to modify the assortment seen by each arriving customer.  Hence, the assortment that each customer purchases from depends on the initial assortment and stocking decisions of the retailer, as well as the purchasing decisions of the preceding customers.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>