File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1111/poms.13443
- Scopus: eid_2-s2.0-85108950028
- WOS: WOS:000668198000001
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Constrained Assortment Optimization Problem under the Multilevel Nested Logit Model
Title | Constrained Assortment Optimization Problem under the Multilevel Nested Logit Model |
---|---|
Authors | |
Issue Date | 2021 |
Publisher | Wiley-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? |
Abstract | We 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 Identifier | http://hdl.handle.net/10722/310140 |
ISSN | 2023 Impact Factor: 4.8 2023 SCImago Journal Rankings: 3.035 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Wang, Y | - |
dc.contributor.author | Shen, ZJM | - |
dc.date.accessioned | 2022-01-24T02:24:26Z | - |
dc.date.available | 2022-01-24T02:24:26Z | - |
dc.date.issued | 2021 | - |
dc.identifier.citation | Production and Operations Management, 2021, v. 30 n. 10, p. 3467-3480 | - |
dc.identifier.issn | 1059-1478 | - |
dc.identifier.uri | http://hdl.handle.net/10722/310140 | - |
dc.description.abstract | We 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.language | eng | - |
dc.publisher | Wiley-Blackwell Publishing, Inc.. The Journal's web site is located at http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1937-5956 | - |
dc.relation.ispartof | Production and Operations Management | - |
dc.rights | Submitted (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.title | Constrained Assortment Optimization Problem under the Multilevel Nested Logit Model | - |
dc.type | Article | - |
dc.identifier.email | Shen, ZJM: maxshen@hku.hk | - |
dc.identifier.authority | Shen, ZJM=rp02779 | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1111/poms.13443 | - |
dc.identifier.scopus | eid_2-s2.0-85108950028 | - |
dc.identifier.hkuros | 331484 | - |
dc.identifier.volume | 30 | - |
dc.identifier.issue | 10 | - |
dc.identifier.spage | 3467 | - |
dc.identifier.epage | 3480 | - |
dc.identifier.isi | WOS:000668198000001 | - |
dc.publisher.place | United States | - |