File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Constrained Assortment Optimization Problem under the Multilevel Nested Logit Model

TitleConstrained Assortment Optimization Problem under the Multilevel Nested Logit Model
Authors
Wang, YShen, ZJM
Issue Date2021
PublisherWiley-Blackwell Publishing, Inc.. The Journal's web site is located at http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1937-5956
Citation
Production and Operations Management, 2021, v. 30 n. 10, p. 3467-3480 How to Cite?
DOI: http://dx.doi.org/10.1111/poms.13443
AbstractWe study the choice-based constrained assortment optimization problem under the multilevel nested logit model with a no-purchase option in every choice stage. For this problem, each candidate product is associated with a fixed profit. The goal is to identify the optimal assortment satisfying a cardinality constraint to maximize the expected profit per customer. There is a cardinality limitation imposed on nodes in the second lowest level. A polynomial-time algorithm with computational complexity O(nmax{m, k}) is provided to locate the optimal assortment for the m-level nested logit model with n products, where k is the maximum number of products within any node in level m − 1.
Persistent Identifierhttp://hdl.handle.net/10722/310140
ISSN
1059-1478
2021 Impact Factor: 4.638
2020 SCImago Journal Rankings: 3.279
ISI Accession Number ID
WOS:000668198000001

 

DC FieldValueLanguage
dc.contributor.authorWang, Y-
dc.contributor.authorShen, ZJM-
dc.date.accessioned2022-01-24T02:24:26Z-
dc.date.available2022-01-24T02:24:26Z-
dc.date.issued2021-
dc.identifier.citationProduction and Operations Management, 2021, v. 30 n. 10, p. 3467-3480-
dc.identifier.issn1059-1478-
dc.identifier.urihttp://hdl.handle.net/10722/310140-
dc.description.abstractWe study the choice-based constrained assortment optimization problem under the multilevel nested logit model with a no-purchase option in every choice stage. For this problem, each candidate product is associated with a fixed profit. The goal is to identify the optimal assortment satisfying a cardinality constraint to maximize the expected profit per customer. There is a cardinality limitation imposed on nodes in the second lowest level. A polynomial-time algorithm with computational complexity O(nmax{m, k}) is provided to locate the optimal assortment for the m-level nested logit model with n products, where k is the maximum number of products within any node in level m − 1.-
dc.languageeng-
dc.publisherWiley-Blackwell Publishing, Inc.. The Journal's web site is located at http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1937-5956-
dc.relation.ispartofProduction and Operations Management-
dc.rightsSubmitted (preprint) Version This is the pre-peer reviewed version of the following article: [FULL CITE], which has been published in final form at [Link to final article using the DOI]. This article may be used for non-commercial purposes in accordance with Wiley Terms and Conditions for Use of Self-Archived Versions. Accepted (peer-reviewed) Version This is the peer reviewed version of the following article: [FULL CITE], which has been published in final form at [Link to final article using the DOI]. This article may be used for non-commercial purposes in accordance with Wiley Terms and Conditions for Use of Self-Archived Versions.-
dc.titleConstrained Assortment Optimization Problem under the Multilevel Nested Logit Model-
dc.typeArticle-
dc.identifier.emailShen, ZJM: maxshen@hku.hk-
dc.identifier.authorityShen, ZJM=rp02779-
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1111/poms.13443-
dc.identifier.scopuseid_2-s2.0-85108950028-
dc.identifier.hkuros331484-
dc.identifier.volume30-
dc.identifier.issue10-
dc.identifier.spage3467-
dc.identifier.epage3480-
dc.identifier.isiWOS:000668198000001-
dc.publisher.placeUnited States-

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats