A tractable discrete fractional programming: application to constrained assortment optimization

DOI10.1007/s10878-018-0302-xzbMath1392.90113OpenAlexW2801371175WikidataQ129831780 ScholiaQ129831780MaRDI QIDQ721924

Tian Xie, Dong-Dong Ge

Publication date: 20 July 2018

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-018-0302-x

zbMATH Keywords

dynamic programmingfractional programmingassortment optimization

Mathematics Subject Classification ID

Fractional programming (90C32) Management decision making, including multiple objectives (90B50) Dynamic programming (90C39)

Related Items (2)

Technical Note—Approximation Schemes for Capacity-Constrained Assortment Optimization Under the Nested Logit Model ⋮ Capacitated assortment and price optimization under the nested logit model

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A greedy algorithm for the two-level nested logit model
• Assortment Optimization Under Variants of the Nested Logit Model
• Capacity Constraints Across Nests in Assortment Optimization Under the Nested Logit Model

This page was built for publication: A tractable discrete fractional programming: application to constrained assortment optimization