On the sum-product ratio problem and its applications

详细信息    查看全文

• 作者：Ruxian Wang ^{ruxian.wang@jhu.edu" class="auth_mail" title="E-mail the corresponding author}
• 关键词：Sum&ndash ; product ratio ; NP-hardness ; Fully polynomial-time approximation scheme ; Consideration set
• 刊名：Operations Research Letters
• 出版年：2016
• 出版时间：May 2016
• 年：2016
• 卷：44
• 期：3
• 页码：409-414
• 全文大小：367 K

文摘

We study the so-called sum–product ratio problem, under which the numerator is the sum of numbers in a subset and the denominator is the product of numbers in the same subset. Unlike the sum–sum ratio problem, which corresponds to the assortment problem under the multinomial logit model, the sum–product ratio problem is generally NP-complete. We develop a fully polynomial-time approximation scheme and discuss several potential applications and useful extensions.