Assortment optimization under the multinomial logit model with product synergies

被引:10
作者
Lo, Venus [1 ]
Topaloglu, Huseyin [2 ]
机构
[1] Cornell Univ, Sch Operat Res & Informat Engn, Ithaca, NY 14853 USA
[2] Cornell Tech, Sch Operat Res & Informat Engn, New York, NY 10044 USA
基金
加拿大自然科学与工程研究理事会;
关键词
Assortment optimization; Synergy; Multinomial logit model; CHOICE; ALGORITHM;
D O I
10.1016/j.orl.2019.09.009
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
In synergistic assortment optimization, a product's attractiveness changes as a function of which other products are offered. We represent synergy structure graphically. Vertices denote products. An edge denotes synergy between two products, which increases their attractiveness when both are offered. Finding an assortment to maximize retailer's expected profit is NP-hard in general. We present efficient algorithms when the graph is a path, a tree, or has low treewidth. We give a linear program to recover the optimal assortment for paths. (C) 2019 Elsevier B.V. All rights reserved.
引用
收藏
页码:546 / 552
页数:7
相关论文
共 29 条
[1]  
[Anonymous], 1959, INDIVIDUAL CHOICE BE
[2]  
[Anonymous], 2014, NEAR OPTIMAL ALGORIT
[3]  
[Anonymous], 2009, Discrete choice methods with simulation
[4]  
[Anonymous], 1973, NOMICS
[5]  
[Anonymous], 1998, Handbook of Combinatorial Optimization, DOI DOI 10.1007/978-1-4613-0303-9
[6]   A Markov Chain Approximation to Choice Modeling [J].
Blanchet, Jose ;
Gallego, Guillermo ;
Goyal, Vineet .
OPERATIONS RESEARCH, 2016, 64 (04) :886-905
[7]   APPROXIMATING TREEWIDTH, PATHWIDTH, FRONTSIZE, AND SHORTEST ELIMINATION TREE [J].
BODLAENDER, HL ;
GILBERT, JR ;
HAFSTEINSSON, H ;
KLOKS, T .
JOURNAL OF ALGORITHMS, 1995, 18 (02) :238-255
[8]   A linear-time ie algorithm for finding three-decompositions of small treewidth [J].
Bodlaender, HL .
SIAM JOURNAL ON COMPUTING, 1996, 25 (06) :1305-1317
[9]  
Brandstadt A., 1999, GRAPH CLASSES SURVEY, V3, P167
[10]   Assortment Optimization Under Variants of the Nested Logit Model [J].
Davis, James M. ;
Gallego, Guillermo ;
Topaloglu, Huseyin .
OPERATIONS RESEARCH, 2014, 62 (02) :250-273