Technical Note—New Bounds for Cardinality-Constrained Assortment Optimization Under the Nested Logit Model
Published Online:17 May 2023https://doi.org/10.1287/opre.2023.2469
- Cited by
- 7 June 2025 | Mathematical Programming, Vol. 216, No. 1-2
- European Journal of Operational Research, Vol. 324, No. 1
- 1 January 2023 | SSRN Electronic Journal, Vol. 67
Volume 71, Issue 4
July-August 2023
Pages iii-vi, 1021-1439, C2-C3
Article Information
Supplemental Material
Metrics
Information
- Received:September 23, 2022
- Accepted:March 16, 2023
- Published Online:May 17, 2023
Copyright © 2023, INFORMS
Cite as
Sumit Kunnumkal (2023) Technical Note—New Bounds for Cardinality-Constrained Assortment Optimization Under the Nested Logit Model. Operations Research 71(4):1112-1119.
https://doi.org/10.1287/opre.2023.2469
Keywords
The author thanks the area editor, the associate editor, and the anonymous reviewers for their comments that improved the manuscript. The author also thanks Huseyin Topaloglu for helpful discussions.
