{"id":{"repo_id":"cornell","oai_identifier":"oai:ecommons.cornell.edu:1813/40949"},"canonical_url":"https://search.ndltd.org/etd/cornell/oai:ecommons.cornell.edu:1813/40949","repository":{"repo_id":"cornell","name":"Cornell University","base_url":"https://ecommons.cornell.edu/server/oai/request"},"display":{"title":"Customer Choice Models And Assortment Optimization","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.","abstract_html":"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.","abstract_has_math":false,"creators":["Davis, James"],"institution":"Cornell University","degree_name":"Ph. D., Operations Research","degree_level":"Doctor of Philosophy","degree_discipline":"Operations Research","degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":["Topaloglu,Huseyin"],"committee_members":["Frazier,Peter","Williamson,David P.","Shmoys,David B."],"year":2015,"date_issued":"2015-08-17","date_published":"2015-08-17","updated_at":"2026-11-19T03:18:46Z","subjects":["Revenue Management","Algorithms","Combinatorial Optimization"],"languages":["en_US"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier.bibid","label":"Dc Identifier Bibid","values":["9255221"],"render_values":[{"text":"9255221","href":null,"code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/1813/40949","outbound_label":"Handle","outbound_source":"dc:identifier.uri","record_url":"https://hdl.handle.net/1813/40949","record_label":"Repository record","record_kind":"handle","record_source":"dc:identifier.uri","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://ecommons.cornell.edu/server/oai/request?verb=GetRecord&metadataPrefix=dim&identifier=oai%3Aecommons.cornell.edu%3A1813%2F40949","prefix":"dim"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.chair","label":"Chair","values":["Topaloglu,Huseyin"]},{"key":"dc:contributor.committeemember","label":"Committee Member","values":["Frazier,Peter","Williamson,David P.","Shmoys,David B."]},{"key":"dc:creator","label":"Author","values":["Davis, James"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2015-10-15T18:01:33Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2015-10-15T18:01:33Z"]},{"key":"dc:date.issued","label":"Date","values":["2015-08-17"]},{"key":"dc:type","label":"Dc Type","values":["dissertation or thesis"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Operations Research"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Doctor of Philosophy"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph. D., Operations Research"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["Cornell University"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Revenue Management","Algorithms","Combinatorial Optimization"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en_US"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.bibid","label":"Dc Identifier Bibid","values":["9255221"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/1813/40949"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"cerif:openaire","label":"Cerif Openaire","values":["<Publication xmlns=\"https://www.openaire.eu/cerif-profile/1.1/\" id=\"aab93725-1a95-4a84-bdbf-b7744425fe00\"> <Type xmlns=\"https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types\">http://purl.org/coar/resource_type/c_1843</Type> <Language>en_US</Language> <Title>Customer Choice Models And Assortment Optimization</Title> <PublishedIn> <Publication> </Publication> </PublishedIn> <PublicationDate>2015-08-17</PublicationDate> <Authors> <Author> <DisplayName>Davis, James</DisplayName> <Affiliation> <OrgUnit> </OrgUnit> </Affiliation> </Author> </Authors> <Editors> </Editors> <Publishers> <Publisher> <OrgUnit /> </Publisher> </Publishers> <Keyword>Revenue Management</Keyword> <Keyword>Algorithms</Keyword> <Keyword>Combinatorial Optimization</Keyword> <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.</Abstract> <Access xmlns=\"http://purl.org/coar/access_right\" > </Access> </Publication>"]},{"key":"cris:virtual.author","label":"Cris Virtual Author","values":["Davis, James"]},{"key":"cris:virtualsource.collection","label":"Cris Virtualsource Collection","values":["5893a6ea-7af3-41d7-abc6-04bcd26ab5df"]},{"key":"dc:description.abstract","label":"Abstract","values":["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."]},{"key":"dc:description.collection","label":"Dc Description Collection","values":["Cornell Theses and Dissertations"]},{"key":"dc:format.mimetype","label":"Dc Format Mimetype","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Customer Choice Models And Assortment Optimization"]},{"key":"dspace:entity.type","label":"Dspace Entity Type","values":["Publication"]},{"key":"others:access_status","label":"Others Access Status","values":["open.access"]}]}],"canonical_facts":{"cerif:openaire":["<Publication xmlns=\"https://www.openaire.eu/cerif-profile/1.1/\" id=\"aab93725-1a95-4a84-bdbf-b7744425fe00\"> <Type xmlns=\"https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types\">http://purl.org/coar/resource_type/c_1843</Type> <Language>en_US</Language> <Title>Customer Choice Models And Assortment Optimization</Title> <PublishedIn> <Publication> </Publication> </PublishedIn> <PublicationDate>2015-08-17</PublicationDate> <Authors> <Author> <DisplayName>Davis, James</DisplayName> <Affiliation> <OrgUnit> </OrgUnit> </Affiliation> </Author> </Authors> <Editors> </Editors> <Publishers> <Publisher> <OrgUnit /> </Publisher> </Publishers> <Keyword>Revenue Management</Keyword> <Keyword>Algorithms</Keyword> <Keyword>Combinatorial Optimization</Keyword> <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.</Abstract> <Access xmlns=\"http://purl.org/coar/access_right\" > </Access> </Publication>"],"cris:virtual.author":["Davis, James"],"cris:virtualsource.collection":["5893a6ea-7af3-41d7-abc6-04bcd26ab5df"],"dc:contributor.chair":["Topaloglu,Huseyin"],"dc:contributor.committeemember":["Frazier,Peter","Williamson,David P.","Shmoys,David B."],"dc:creator":["Davis, James"],"dc:date.accessioned":["2015-10-15T18:01:33Z"],"dc:date.available":["2015-10-15T18:01:33Z"],"dc:date.issued":["2015-08-17"],"dc:description.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."],"dc:description.collection":["Cornell Theses and Dissertations"],"dc:format.mimetype":["application/pdf"],"dc:identifier.bibid":["9255221"],"dc:identifier.uri":["https://hdl.handle.net/1813/40949"],"dc:language.iso":["en_US"],"dc:subject":["Revenue Management","Algorithms","Combinatorial Optimization"],"dc:title":["Customer Choice Models And Assortment Optimization"],"dc:type":["dissertation or thesis"],"dspace:entity.type":["Publication"],"others:access_status":["open.access"],"thesis:degree_discipline":["Operations Research"],"thesis:degree_level":["Doctor of Philosophy"],"thesis:degree_name":["Ph. D., Operations Research"],"thesis:institution_name":["Cornell University"]},"updated_at":"2026-11-19T03:18:46Z"}