Technical Note—New Bounds for Cardinality-Constrained Assortment Optimization Under the Nested Logit Model

DOI10.1287/opre.2023.2469OpenAlexW4376877593MaRDI QIDQ6192785

Sumit Kunnumkal

Publication date: 12 March 2024

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.2023.2469

zbMATH Keywords

linear programmingnested logitchoice models

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

This page was built for publication: Technical Note—New Bounds for Cardinality-Constrained Assortment Optimization Under the Nested Logit Model