<?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-21T10:42:58Z</responseDate><request verb="GetRecord" identifier="oai:ecommons.cornell.edu:1813/40949" metadataPrefix="dim">https://ecommons.cornell.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:ecommons.cornell.edu:1813/40949</identifier><datestamp>2026-05-14T13:55:09Z</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">Davis, James</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="chair">Topaloglu,Huseyin</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="committeeMember">Frazier,Peter</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="committeeMember">Williamson,David P.</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="committeeMember">Shmoys,David B.</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2015-10-15T18:01:33Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2015-10-15T18:01:33Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2015-08-17</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://hdl.handle.net/1813/40949</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="bibid">9255221</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract">This thesis handles a fundamental problem in retail: given an enormous variety of products which does the retailer display to its customers? This is the assortment planning problem. We solve this problem by developing algorithms that, given input parameters for products, can efficiently return the set of products that should be displayed. To develop these algorithms we use a mathematical model of how customers react to displayed items, a customer choice model. Below we consider two classic customer choice models, the Multinomial Logit model and Nested Logit model. Under each of these customer choice models we develop algorithms that solve the assortment planning problem. Additionally, we consider the constrained assortment planning problem where the retailer must display products to customers but must also satisfy operational constraints.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso">en_US</dim:field>
   <dim:field mdschema="dc" element="subject">Revenue Management</dim:field>
   <dim:field mdschema="dc" element="subject">Algorithms</dim:field>
   <dim:field mdschema="dc" element="subject">Combinatorial Optimization</dim:field>
   <dim:field mdschema="dc" element="title">Customer Choice Models And 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</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</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">Davis, James</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="aab93725-1a95-4a84-bdbf-b7744425fe00">
	&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>Customer Choice Models And Assortment Optimization&lt;/Title>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2015-08-17&lt;/PublicationDate>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Davis, James&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>Revenue Management&lt;/Keyword>
    &lt;Keyword>Algorithms&lt;/Keyword>
    &lt;Keyword>Combinatorial Optimization&lt;/Keyword>
   	&lt;Abstract>This thesis handles a fundamental problem in retail: given an enormous variety of products which does the retailer display to its customers? This is the assortment planning problem. We solve this problem by developing algorithms that, given input parameters for products, can efficiently return the set of products that should be displayed. To develop these algorithms we use a mathematical model of how customers react to displayed items, a customer choice model. Below we consider two classic customer choice models, the Multinomial Logit model and Nested Logit model. Under each of these customer choice models we develop algorithms that solve the assortment planning problem. Additionally, we consider the constrained assortment planning problem where the retailer must display products to customers but must also satisfy operational constraints.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>