Savedrecs

Publicatio Authors Book AuthoBook Edito Book GroupAuthor Ful Book AuthoGroup AuthArticle TitleSource Titl
J Wang, RX Wang, Ruxian CapacitatedOPERATIONS RESEAR

J Li, XL; Ke, JN Li, Xiaolong; Ke, Jiannan Robust assOPERATIONS RESEAR
J El Housni, O; Topaloglu, H El Housni, Omar; Topaloglu, HuseJoint AssorOPERATIONS RESEAR
J Xiao, H; Gong, M; Lian, ZT; Nip, K Xiao, Hua; Gong, Min; Lian, Zha Joint promoNAVAL RESEARCH LO
J Peeters, Y; den Boer, AV Peeters, Yannik; den Boer, Arnou Stochastic NAVAL RESEARCH LO
J Flores, A; Berbeglia, G; Van Hentenryck, P Flores, Alvaro; Berbeglia, Gerard AssortmentEUROPEAN JOURNAL
J Bebitoglu, B; Sen, A; Kaminsky, P Bebitoglu, Basak; Sen, Alper; KamConstrainedNAVAL RESEARCH LO
J Kunnumkal, S Kunnumkal, Sumit On upper bo OPERATIONS RESEAR
J Sen, A; Atamtürk, A; Kaminsky, P Sen, Alper; Atamturk, Alper; KamiTechnical OPERATIONS RESEAR
J Lo, V; Topaloglu, H Lo, Venus; Topaloglu, Huseyin AssortmentOPERATIONS RESEAR
J Feldman, J; Topaloglu, H Feldman, Jacob; Topaloglu, HuseTechnical OPERATIONS RESEAR
J Rusmevichientong, P; Shmoys, D; Tong, CX;Rusmevichientong, Paat; Shmoys,AssortmentPRODUCTION AND OP
J Liu, N; Ma, YH; Topaloglu, H Liu, Nan; Ma, Yuhang; Topaloglu, AssortmentINFORMS JOURNAL O
J Besbes, O; Sauré, D Besbes, Omar; Saure, Denis Product As PRODUCTION AND OP
J Chen, X; Wang, YN; Zhou, Y Chen, Xi; Wang, Yining; Zhou, Y Optimal PoMATHEMATICS OF OP
J Bai, YC; Feldman, J; Segev, D; Topaloglu, H Bai, Yicheng; Feldman, Jacob; S AssortmentOPERATIONS RESEAR
J Cao, YF; Rusmevichientong, P; Topaloglu, H Cao, Yufeng; Rusmevichientong, Revenue Ma OPERATIONS RESEAR
J Jin, QW; Lin, JY; Zhou, SX Jin, Qingwei; Lin, Jen-Yen; Zhou, Price disco IISE TRANSACTIONS
J Feldman, J; Topaloglu, H Feldman, Jacob; Topaloglu, HuseBounding OPRODUCTION AND OP
J Lo, V; Topaloglu, H Lo, Venus; Topaloglu, Huseyin Omnichanne M&SOM-MANUFACTUR
J Chen, R; Jiang, H Chen, Rui; Jiang, Hai CapacitatedOPERATIONS RESEAR
J Sumida, M; Gallego, G; Rusmevichientong, P;Sumida, Mika; Gallego, Guillermo Revenue-Uti MANAGEMENT SCIEN
J Abeliuk, A; Berbeglia, G; Cebrian, M; Van HeAbeliuk, Andres; Berbeglia, Gera Assortment4OR-A QUARTERLY JO
J Gao, P; Ma, YH; Chen, NY; Gallego, G; Li, A Gao, Pin; Ma, Yuhang; Chen, NingAssortmentOPERATIONS RESEAR
J Rusmevichientong, P; Shen, ZJM; Shmoys, Rusmevichientong, Paat; Shen, Z Dynamic AsOPERATIONS RESEAR
J Bai, YC; Feldman, J; Topaloglu, H; Wagner, Bai, Yicheng; Feldman, Jacob; ToAssortmentOPERATIONS RESEAR
J Li, ZL Li, Zhaolin A single-pePRODUCTION AND OP
J Leitner, M; Lodi, A; Roberti, R; Sole, C Leitner, Markus; Lodi, Andrea; RoAn Exact MINFORMS JOURNAL O
J Aouad, A; Levi, R; Segev, D Aouad, Ali; Levi, Retsef; Segev, Greedy-Lik OPERATIONS RESEAR
J Désir, A; Goyal, V; Zhang, JW Desir, Antoine; Goyal, Vineet; Zh Capacitate OPERATIONS RESEAR
J Peeters, Y; den Boer, AV; Mandjes, M Peeters, Yannik; den Boer, Arnou ContinuousOPERATIONS RESEAR
J Chen, X; Shi, C; Wang, YN; Zhou, Y Chen, Xi; Shi, Chao; Wang, Yinin Dynamic AsPRODUCTION AND OP
J Mao, ST; Chao, XL Mao, Sentao; Chao, Xiuli Dynamic JoM&SOM-MANUFACTUR
J Feldman, J; Jiang, PP Feldman, Jacob; Jiang, Puping Display optPRODUCTION AND OP
J Rusmevichientong, P; Topaloglu, H Rusmevichientong, Paat; TopalogRobust AssOPERATIONS RESEAR
J Alptekinoglu, A; Semple, JH Alptekinoglu, Aydin; Semple, Joh The ExponoOPERATIONS RESEAR
J Wang, ZC; Peura, H; Wiesemann, W Wang, Zhengchao; Peura, Heikki Randomized OPERATIONS RESEAR
J Tang, SJ; Yuan, J; Wang, CH; Wang, Y; Che Tang, Shaojie; Yuan, Jing; Wang AssortmentOPERATIONS RESEAR
J Feldman, J; Segev, D Feldman, Jacob; Segev, Danny Technical OPERATIONS RESEAR
J Méndez-Díaz, I; Miranda-Bront, JJ; Vulcano, Mendez-Diaz, Isabel; Jose MirandA branch-anDISCRETE APPLIED M
J Peeters, Y; den Boer, AV Peeters, Yannik; den Boer, Arnou A regret lo PROBABILITY IN THE
J Aouad, A; Segev, D Aouad, Ali; Segev, Danny Display OptMANAGEMENT SCIEN
J Li, HM; Webster, S; Mason, N; Kempf, K Li, Hongmin; Webster, Scott; Mas Product-Li M&SOM-MANUFACTUR
J Tan, YY; Guo, CX Tan, Yuyang; Guo, Chunxiang Bi-objecti JOURNAL OF THE OPE
J Agrawal, S; Avadhanula, V; Goyal, V; Zeevi, Agrawal, Shipra; Avadhanula, Vash MNL-BanditOPERATIONS RESEAR
J Qiu, JQ; Li, XY; Duan, YR; Chen, MX; Tian, Qiu, Jiaqing; Li, Xiangyong; Duan Dynamic asJOURNAL OF RETAILIN
J Cao, YF; Kleywegt, AJ; Wang, H Cao, Yufeng; Kleywegt, Anton J. Network ReOPERATIONS RESEAR
J Chung, H; Ahn, HS; Jasin, S Chung, Hakjin; Ahn, Hyun-Soo; Ja(Rescaled) PRODUCTION AND OP
J Agrawal, P; Tulabandhula, T; Avadhanula, V Agrawal, Priyank; Tulabandhula, A tractable EUROPEAN JOURNAL
J Mehrani, S; Sefair, JA Mehrani, Saharnaz; Sefair, Jorge Robust asso EUROPEAN JOURNAL
J Yu, YG; Wang, B; Zheng, SM Yu, Yugang; Wang, Bo; Zheng, Data-drivenTRANSPORTATION RE
J Chen, X; Krishnamurthy, A; Wang, YN Chen, Xi; Krishnamurthy, Akshay;Robust DynOPERATIONS RESEAR
J Aouad, A; Saban, D Aouad, Ali; Saban, Daniela Online Ass MANAGEMENT SCIEN
J Wu, MT; Pei, Z Wu, Mengting; Pei, Zhi Multi-Locat APPLIED SCIENCES-B
J Chen, X; Wang, YN; Zhou, Y Chen, Xi; Wang, Yining; Zhou, Y Dynamic AsJOURNAL OF MACHIN
J Li, HM; Webster, S; Yu, G Li, Hongmin; Webster, Scott; Yu, Product DesM&SOM-MANUFACTUR
J Balseiro, SR; Désir, A Balseiro, Santiago R.; Desir, Anto Incentive- MANAGEMENT SCIEN
J Chen, X; Wang, YN Chen, Xi; Wang, Yining A note on aOPERATIONS RESEAR
J Wang, RX Wang, Ruxian When ProspM&SOM-MANUFACTUR
J Aouad, A; Feldman, J; Segev, D Aouad, Ali; Feldman, Jacob; Seg The ExponoMANAGEMENT SCIEN
J Miao, ST; Chao, XL Miao, Sentao; Chao, Xiuli Online Per M&SOM-MANUFACTUR
J Ahmed, A; Sohoni, MG; Bandi, C Ahmed, Asrar; Sohoni, Milind G.; ParameterizOPERATIONS RESEAR
J Paul, A; Feldman, J; Davis, JM Paul, Alice; Feldman, Jacob; Dav AssortmentM&SOM-MANUFACTUR
J Alfandari, L; Denoyel, V; Thiele, A Alfandari, Laurent; Denoyel, VictoiSolving uti ANNALS OF OPERATIO
J Désir, A; Goyal, V; Segev, D; Ye, C Desir, Antoine; Goyal, Vineet; S Constraine MANAGEMENT SCIEN
J Wang, RX; Ke, CX; Zhaoc, ZF Wang, Ruxian; Ke, Chenxu; ZhaocAnticipate M&SOM-MANUFACTUR
J Vasilyev, A; Maier, S; Seifert, RW Vasilyev, Andrey; Maier, SebastianAssortmentEUROPEAN JOURNAL
J Berbeglia, G; Joret, G Berbeglia, Gerardo; Joret, GwenaAssortmentALGORITHMICA
J Saberi, Z; Hussain, OK; Saberi, M Saberi, Zahra; Hussain, Omar K.; Data-drivenCOMPUTERS & INDUS
J Wang, RX Wang, Ruxian Technical OPERATIONS RESEAR
J Kunnumkal, S; Martínez-de-Albéniz, V Kunnumkal, Sumit; Martinez-de-AlTractable OPERATIONS RESEAR
J Rieger, A; Segev, D Rieger, Alon; Segev, Danny Quasi-poly MATHEMATICAL PROG
J Ma, W Ma, Will When Is AsMANAGEMENT SCIEN
J Arhami, O; Aslani, S; Talebian, M Arhami, Omid; Aslani, Shirin; Tal Dynamic ass JOURNAL OF RETAILIN
J Wang, XL; Zhao, XJ; Liu, B Wang, Xiaolin; Zhao, Xiujie; Liu, BDesign andEUROPEAN JOURNAL
J van de Geer, R; den Boer, AV van de Geer, Ruben; den Boer, A Price OptimMANAGEMENT SCIEN
J Li, S; Udwani, R Li, Selena; Udwani, Rajan The non-Mar OPERATIONS RESEAR
J Pourhossein, F; Huh, WT; Shechter, SM Pourhossein, Forough; Huh, WoonAssortmentDECISION ANALYSIS
J Wang, MM; Zhang, X; Li, XL Wang, Mengmeng; Zhang, Xun; LiMultiple-pu INTERNATIONAL JOUR
J Abdallah, T; Vulcano, G Abdallah, Tarek; Vulcano, Gustav Demand EstM&SOM-MANUFACTUR
J Tulabandhula, T; Sinha, D; Karra, S Tulabandhula, Theja; Sinha, DeekOptimizing EUROPEAN JOURNAL
J Du, CH; Cooper, WL; Wang, ZZ Du, Chenhao; Cooper, William L. Optimal PriOPERATIONS RESEAR
J Mani, V; Thomas, DJ; Bansal, S Mani, Vidya; Thomas, Douglas J.;Estimating MANAGEMENT SCIEN
J Blanchet, J; Gallego, G; Goyal, V Blanchet, Jose; Gallego, Guillerm A Markov COPERATIONS RESEAR
J Li, HM; Webster, S Li, Hongmin; Webster, Scott Optimal PriOPERATIONS RESEAR
J Çömez-Dolgan, N; Moussawi-Haidar, L; JabeComez-Dolgan, Nagihan; Moussaw CapacitatedINTERNATIONAL JOUR
J Atamtürk, A; Gómez, A Atamturk, Alper; Gomez, Andres MaximizingOPERATIONS RESEAR
J Aouad, A; Segev, D Aouad, Ali; Segev, Danny The Stabil OPERATIONS RESEAR
J Wang, RX Wang, Ruxian What Is th M&SOM-MANUFACTUR
J Umpfenbach, EL; Dalkiran, E; Chinnam, RB; Umpfenbach, Edward Lawrence; Da OptimizatioJOURNAL OF THE OPE
J Çetin, O; Mersereau, AJ; Parlaktürk, AK Cetin, Oguz; Mersereau, Adam J.;Management M&SOM-MANUFACTUR
J Lu, WT Lu, Wentao Bounds on OPERATIONS RESEAR
J Mishra, VK; Natarajan, K; Tao, H; Teo, CP Mishra, Vinit Kumar; Natarajan, Choice PredIEEE TRANSACTIONS
J Keller, PW; Levi, R; Perakis, G Keller, Philipp W.; Levi, Retsef; P Efficient f MATHEMATICAL PROG
J Pérez, J; López-Ospina, H Perez, Juan; Lopez-Ospina, Hect Competitiv MATHEMATICS
J Nosrat, F; Cooper, WL; Wang, ZZ Nosrat, Fatemeh; Cooper, WilliamPricing for NAVAL RESEARCH LO
J Fox, E; Norman, L; Semple, J Fox, Edward; Norman, Laura; Se Choosing aMANAGEMENT SCIEN
J Wang, RX; Ke, CX; Cui, SL Wang, Ruxian; Ke, Chenxu; Cui, SProduct Pr M&SOM-MANUFACTUR
J Page, K; Pérez, J; Telha, C; García-Echalar, Page, Kenneth; Perez, Juan; TelhOptimal bunEUROPEAN JOURNAL
J Lee, H; Eun, Y Lee, Haengju; Eun, Yongsoon Estimating IIE TRANSACTIONS
J Wang, RX Wang, Ruxian The ThreshM&SOM-MANUFACTUR
J Li, HM; Webster, S Li, Hongmin; Webster, Scott Optimizing OPERATIONS RESEAR
J Feldman, J; Zhang, DJ; Liu, XF; Zhang, NN Feldman, Jacob; Zhang, Dennis J.Customer COPERATIONS RESEAR
J Wang, RX Wang, Ruxian On the sum-OPERATIONS RESEAR
J Lei, YZ; Jasin, S; Uichanco, J; Vakhutinsky, Lei, Yanzhe (Murray); Jasin, Stef Joint ProduM&SOM-MANUFACTUR
J Asadpour, A; Niazadeh, R; Saberi, A; ShamelAsadpour, Arash; Niazadeh, Rad; Sequential OPERATIONS RESEAR
J Huh, WT; Li, HM Huh, Woonghee T.; Li, Hongmin Product-lin PRODUCTION AND OP
J Müller, S; Haase, K Mueller, Sven; Haase, Knut On the prodOPERATIONS RESEAR
J Berbeglia, G; Garassino, A; Vulcano, G Berbeglia, Gerardo; Garassino, A A Comparati MANAGEMENT SCIEN
J Kunnumkal, S; Talluri, K Kunnumkal, Sumit; Talluri, KalyanChoice NetTRANSPORTATION SC
J Park, J; Mo, J Park, Jungju; Mo, Jeonghoon An efficien OPTIMIZATION LETTE
J Qi, M; Mak, HY; Shen, ZJM Qi, Meng; Mak, Ho-Yin; Shen, Zu Data-drivenNAVAL RESEARCH LO
J Dam, TT; Ta, TA; Mai, T Dam, Tien Thanh; Ta, Thuy Anh; Robust maxi EUROPEAN JOURNAL
J Tang, SJ; Yuan, J Tang, Shaojie; Yuan, Jing Cascade SuPRODUCTION AND OP
J Kunnumkal, S; Talluri, K Kunnumkal, Sumit; Talluri, KalyanA strong L COMPUTATIONAL OPT
J Berbeglia, F; Berbeglia, G; Van Hentenryck, Berbeglia, Franco; Berbeglia, Ge Market segm EUROPEAN JOURNAL
J Barbier, T; Anjos, MF; Cirinei, F; Savard, G Barbier, Thibault; Anjos, Miguel F.Product-cl EUROPEAN JOURNAL
J Lee, H; Eun, Y Lee, Haengju; Eun, Yongsoon Discoverin EUROPEAN JOURNAL
J Gallego, G; Li, AR; Truong, VA; Wang, XS Gallego, Guillermo; Li, Anran; V ApproximatiOPERATIONS RESEAR
Book SeriesBook SeriesLanguage Document ConferenceConferenceConferenceConferenceConferenceAuthor Key
OPERATIONS RESEARCH LETTERS
OPERATIONS RESEARCH
NAVAL RESEARCH LOGISTICS
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
OPERATIONS RESEARCH
OPERATIONS RESEARCH
PRODUCTION AND OPERATIONS MANAGEMENT
INFORMS JOURNAL ON COMPUTING
MATHEMATICS OF OPERATIONS RESEARCH
OPERATIONS RESEARCH
OPERATIONS RESEARCH
IISE TRANSACTIONS
M&SOM-MANUFACTURING & SERVICE OPERATIONS MANAGEMENT
MANAGEMENT SCIENCE
4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH
OPERATIONS RESEARCH
OPERATIONS RESEARCH
OPERATIONS RESEARCH
INFORMS JOURNAL ON COMPUTING
OPERATIONS RESEARCH
OPERATIONS RESEARCH
OPERATIONS RESEARCH
OPERATIONS RESEARCH
OPERATIONS RESEARCH INFORMS A NOV 09-12San Francisco, CA
OPERATIONS RESEARCH
OPERATIONS RESEARCH
DISCRETE APPLIED MATHEMATICS 1st Intern MAR 24-26Hammamet, TUNISIA
PROBABILITY IN THE ENGINEERING AND INFORMATIONAL SCIENCES
MANAGEMENT SCIENCE
M&SOM-MANUFACTURING & SERVICE OPERATION Manufactur 2017 Univ N Carolina, ChapeUniv N Carolina
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
OPERATIONS RESEARCH
JOURNAL OF RETAILING AND CONSUMER SERVICES
OPERATIONS RESEARCH
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW
OPERATIONS RESEARCH
MANAGEMENT SCIENCE
APPLIED SCIENCES-BASEL
JOURNAL OF MACHINE LEARNING RESEARCH
MANAGEMENT SCIENCE
MANAGEMENT SCIENCE
ANNALS OF OPERATIONS RESEARCH
MANAGEMENT SCIENCE
ALGORITHMICA
COMPUTERS & INDUSTRIAL ENGINEERING
OPERATIONS RESEARCH
OPERATIONS RESEARCH
MATHEMATICAL PROGRAMMING
MANAGEMENT SCIENCE
JOURNAL OF RETAILING AND CONSUMER SERVICES
MANAGEMENT SCIENCE
DECISION ANALYSIS
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS
OPERATIONS RESEARCH
MANAGEMENT SCIENCE
OPERATIONS RESEARCH
OPERATIONS RESEARCH
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS
OPERATIONS RESEARCH
OPERATIONS RESEARCH
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
IEEE TRANSACTIONS ON AUTOMATIC CONTROL
MATHEMATICAL PROGRAMMING
MATHEMATICS
MANAGEMENT SCIENCE
IIE TRANSACTIONS
OPERATIONS RESEARCH
OPERATIONS RESEARCH
OPERATIONS RESEARCH
MANAGEMENT SCIENCE
TRANSPORTATION SCIENCE
OPTIMIZATION LETTERS
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS
OPERATIONS RESEARCH
Keywords PAbstract Addresses Affiliations Reprint Ad Email Addr ResearcherORCIDs Funding OrFunding Na
We consider an assortment and price optimization problem where a retailer chooses an assortment of competing p
We consider robust assortment optimization problems with Li, xiaolong/GRS-9148-2022; 柯, 剑男/GWC-9813-2022; li
We consider a joint assortment optimization and customization problEl housni, Omar/0000-0003-3097-8571
Promotional effort is a common strategy to induce sales and broaden the market scope by enhancing the products
We consider dynamic assortment optimization with incomplete informa Peeters, Yannik/0000-0003-0335-8836
We study the assortment optimization problem under theBerbeglia,
S Berbeglia, Gerardo/0000-0003-0108-2936; Flo
We study the assortment optimization problem in an online setting where a retailer uses multiple distribution center
The assortment optimization problem under the mixture oKunnumkal,Kunnumkal, Sumit/0000-0002-6832-0508
We consider the constrained assortment optimization problem under the mixed multinomial logit model. Even mode
In synergistic assortment optimization, a product's attr Lo, Venus Lo, Venus/0000-0001-5753-8694
We study capacitated assortment problems when customers choose under the multinomial logit model with nested
We consider assortment optimization problems under theShmoys, David/E-6844-2012
We consider assortment optimization problems, where the Ma, Yuhan Ma, Yuhang/0000-0001-7008-253X
The role of assortment planning and pricing in shaping saSaure, DenSaure, Denis/0000-0002-8123-5009
We study the dynamic assortment planning problem, where Wang, Yini Wang, Yining/0000-0001-9410-0392; Zhou, Yu
In this paper, we introduce the Multi-Purchase Multinomial Logit ch Wagner, Laura/0000-0003-1299-3196; Bai, Yic
We consider assortment optimization problems when customers choose Rusmevichientong, Paat/0000-0001-9584-420
With increasing availability of consumer data and rapid Zhou, SeanLin, Jen-Yen/0000-0001-9755-7064
We consider assortment problems under a mixture of multinomial logit models. There is a fixed revenue associated
Problem definition: We consider the assortment optimization problemLo, Venus/0000-0001-5753-8694
We study the capacitated assortment and price optimization problemJiang, Hai/0000-0003-3414-9682
We examine the revenue-utility assortment optimization pGallego, G Gallego, Guillermo/0000-0002-9664-3750; Rus
Motivated by applications in retail, online advertising, Berbeglia, Berbeglia, Gerardo/0000-0003-0108-2936; Ab
We develop a variant of the multinomial logit model with Chen, NingLi, Anran/0000-0001-7001-2240; Gao, Pin/000
We consider an assortment optimization problem where aShmoys,
r DaShen, Zuo-Jun Max/0000-0003-4538-8312; Sh
We study assortment optimization problems under a natural variant of Wagner, Laura/0000-0003-1299-3196
This paper studies a single-period assortment optimizatioLi, Zhaolin/A-1756-2011
We study the problem of optimizing assortment decisions in the pre LODI, ANDREA/0000-0001-9269-633X; Leitne
We study the joint assortment planning and inventory man Aouad, Al Aouad, Ali/0000-0002-9812-6140; Levi, Retsef
Assortment optimization is an important problem that arises in manyGoyal, Vineet/0000-0001-6719-3212
We consider assortment optimization over a continuous spectrum ofPeeters,
pr Yannik/0000-0003-0335-8836; den B
We study a stylized dynamic assortment planning problem Wang, Yini Wang, Yining/0000-0001-9410-0392; Zhou, Yu
Problem definition: We consider a joint assortment optimization and pricing problem where customers arrive seque
In this paper, we consider an assortment optimization problem in which a platform must choose pairwise disjoint se
We study robust formulations of assortment optimization problems under the multinomial logit choice model. The n
We investigate the use of a canonical version of a discrete choice model due to Daganzo (1979) [Daganzo C (1979
When a firm selects an assortment of products to offer to customersPeura, Heikki/0000-0002-1414-107X
In this paper, we study the assortment optimization prob Wang, CheYuan, Jing/0000-0001-6407-834X
In this paper, we consider the assortment problem under the multinomial logit (MNL) model with sequential offering
We study the product assortment problem of a retail opera Vulcano, GVulcano, Gustavo/0000-0003-0083-4737; Mira
In this note, we consider dynamic assortment optimization with inco Peeters, Yannik/0000-0003-0335-8836
We introduce a new optimization model, dubbed the displa Aouad, Al Aouad, Ali/0000-0002-9812-6140
We study a product-line price optimization problem with demand given Kempf, Karl/0000-0001-9860-5419; Li, Hongm
Assortment planning is a challenge for retailers because most current solutions only consider revenue maximizatio
We consider a dynamic assortment selection problem where in every round the retailer offers a subset (assortment
In this paper, we study the dynamic assortment planning , Xiangyong Li/HNR-7107-2023
Airline booking data have shown that the fraction of cus Cao, Yufe Kleywegt, Anton/0000-0002-1849-7276; Cao, Y
When designing an assortment, a fundamental trade-off eLi, Wang/MChung, Hakjin/0000-0002-0241-0244
In this paper, we consider the contextual variant of the MNL-Bandit problem. More specifically, we con -sider a dyn
Assortment planning is a central piece in the revenue management st Sefair, Jorge/0000-0002-5887-8938
Our study focuses on how real -world data can inform and Zheng, Sh Zheng, Shengming/0000-0003-2812-3451
We consider the dynamic assortment optimization problem Wang, Naom Wang, Yining/0000-0001-9410-0392
Motivated by online labor markets, we consider the online assortmenAouad, Mohammed/0000-0002-9812-6140
This paper studies the constrained multi-location assort Pei, Zhi/A Pei, Zhi/0000-0001-6808-1490
In this paper, we study the dynamic assortment optimizatWang, Yini Wang, Yining/0000-0001-9410-0392
Problem definition: We study a product-line design problem Yu, GwangWebster, Scott/0000-0002-4086-8088
Online marketplaces, such as Amazon, Alibaba, Google Shopping, and JD.com, allow sellers to promote their prod
In this short note we consider a dynamic assortment pla Wang, Yini Wang, Yining/0000-0001-9410-0392
Problem definition: Reference prices arise as price expectations ag Wang, Ruxian/0000-0002-0559-8027
In this paper, we consider the yet-uncharted assortment Aouad, Al Aouad, Ali/0000-0002-9812-6140
Problem definition: Consider an online personalized assortment optiChao, Xiuli/0000-0001-5233-4385
We consider the problem faced by an online service platfSohoni, Mi Sohoni, Milind/0000-0002-5236-2375
We consider assortment and pricing problems when customers purchase products according to a nonparametric ch
We investigate First-Choice (FC) assignment models, a simple type of choice model where customers are allocated
Assortment optimization is an important problem that arises in many practical applications such as retailing and on
Problem definition: We investigate the effects of waiting time, mainly due to production in a make -to -batch -order
Making assortment decisions is becoming an increasinglySeifert, R Seifert, Ralf W./0000-0002-2090-992X; Maier,
The assortment problem in revenue management is the problem of deciding which subset of products to offer to co
Online shopping has enabled customers (shoppers) to acce saberi, za Saberi, Morteza/0000-0002-5168-2078
Market size, measured by the number of people who are interested iWang, Ruxian/0000-0002-0559-8027
Assortment planning under a logit demand model is a diff; KunnumkaMartinez-de-Albeniz, Victor/0000-0001-8391-2
In spite of its widespread applicability in learning theory, probability, combinatorics, and in various other fields, the M
who will purchase at most one. Typically, retailers select a subset /0000-0002-2420-4468
We consider dynamic assortment planning and capacity allocation over ARHAMI, OMID/0009-0005-2681-6598
This paper studies the design and pricing of an extendedWang, XiaoWang, Xiao-Lin/0000-0003-0100-8154; Liu, Bin
We consider price optimization under the finite-mixture logit model den Boer, Arnoud/0000-0003-4779-0436
Discrete choice models are widely used for understanding how customers choose between a variety of substitutab
Limited information, time, or capacity may prevent customers from acHuh, Woonghee Tim/0000-0001-7429-8477
Although multiple-purchase behavior is typical in retai Li, xiaol Zhang, Xun/0000-0002-3721-5107
Problem definition: A major task in retail operations is Abdallah, Abdallah, Tarek/0000-0001-8175-7117
Scalable real-time assortment optimization has become essential in /0000-0002-9788-728X
e-
We consider a seller's problem of determining revenue-maximizing pri Wang, Zizhuo/0000-0003-0828-7280
Many retailers are reducing store footprint and downsizing their ass bansal, saurabh/0000-0001-5443-4144
Assortment planning is an important problem that arises iGallego, G Gallego, Guillermo/0000-0002-9664-3750; Bla
In this paper, we study price optimization with price-demand relati Li, Hongmin/0000-0002-1107-6348
We analyze a joint assortment optimization problem for multiple locaJaber, Mohamad Y./0000-0001-7490-5396
Given a polytope X, a monotone concave univariate function g, and two Gomez, Andres/0000-0003-3668-0653
We study the dynamic assortment planning problem under the widely Aouad,
u Mohammed/0000-0002-9812-6140
Problem definition: This paper examines the impact of nonrandomness Wang, Ruxian/0000-0002-0559-8027
Assortment planning aims to select the set of products t Chinnam, RMurat, Alper/0000-0002-1906-6777; Chinnam,
Problem definition: We examine a brick-and-moriar retaileParlakturk, Parlakturk, Ali/0000-0002-1495-2614; Cetin, O
The random consideration set choice model is a recently proposed choice model that can capture the stochastic ch
We consider the problem of making choice prediction by T oeo, ChungTeo, Chung Piaw/0000-0002-0534-6858; Nata
We propose a modeling and optimization framework to cast a broad range of fundamental multi-product pricing pro
Defining prices and in which consumers' segments to put the company Lopez-Ospina, Hector/0000-0001-8144-6394;
We consider a pricing problem for a single product that Nosrat, F Wang, Zizhuo/0000-0003-0828-7280
We develop a framework to model the shopping and consumption decisions of forward-looking consumers. Assum
Problem definition: In this paper, we develop an integrated frameworCui, Shiliang/0000-0002-6643-6865; Wang, Ru
We propose a model to design bundles' composition under Echalar,
c A Echalar, Andrés García/0000-0002-7027-001X
This paper discusses the estimation of primary demand (i.e., the tr Lee, Haengju/0000-0002-6290-0229
Problem definition: This paper investigates the threshold effects on Wang, Ruxian/0000-0002-0559-8027
We examine a firm's pricing decision when managing a broad product line with the goal of optimally balancing the e
We compare the performance of two approaches for finding the optimal set of products to display to customers lan
We study the so-called sum-product ratio problem, under which the numerator is the sum of numbers in a subset a
Problem definition: We study a joint product framing and order fulfi Uichanco, Joline/0000-0003-2110-7088; Lei, Y
We study a submodular maximization problem motivatedNiazadeh,
by a Niazadeh, Rad/0000-0002-5880-6221
In many settings, consumer surplus directly impacts a firm or organization's objective, and the profit-only objective
Jiao and Zhang (2005) propose a shared-surplus maximiza Müller, Sv Müller, Sven/0000-0002-3406-2133; Haase, K
Choice-based demand estimation is a fundamental task in Berbeglia, Berbeglia, Gerardo/0000-0003-0108-2936
The choice network revenue management model incorporates ; KunnumkaTalluri, Kalyan/0000-0003-1608-6403; Kunnum
In this paper, we propose an exact solution approach to solve a joint product line selection and pricing problem with
We review the operations research/management scienceShen, lit Zuo Shen, Zuo-Jun Max/0000-0003-4538-8312; Ma
We study a robust version of the maximum capture facility location Mai, Tien/0000-0003-3263-5003
Personality quiz is a powerful tool that enables costumer segmentatiYuan, Jing/0000-0001-6407-834X
Discrete-choice network revenue management (DC-NRM) Kunnumkal,
capt Talluri, Kalyan/0000-0003-1608-6403
This paper studies ranking policies in a stylized trial- Berbeglia, Berbeglia, Gerardo/0000-0003-0108-2936
Most recent research in network revenue management inco Anjos, Mig Anjos, Miguel F./0000-0002-8258-9116; Barbie
We propose a demand estimation method to discover heterogeneous Lee,
co Haengju/0000-0002-6290-0229
We propose one of the first models of product framing anGallego, G Gallego, Guillermo/0000-0002-9664-3750
Funding TeCited Refe Cited Refe Times Cite Times Cite 180 Day U Since 2013Publisher Publisher CPublisher
ssortment of competing products and determines their prices to maximize the total expected profit subject to a capacity constraint.
剑男/GWC-9813-2022; li, xiao/HJP-5134-2023; li, xiao/GSN-6181-2022
0-0003-3097-8571
y enhancing the products' utility to customers. In this article, we incorporate promotional effort into the customer choice model
0-0003-0335-8836
000-0003-0108-2936; Flores, Alvaro/0000-0001-8156-9458
multiple distribution centers (DC) to fulfill orders from multiple regions. Customer choice in each region follows a multinom
000-0002-6832-0508
al logit model. Even moderately sized instances of this problem are challenging to solve directly using standard mixed-integer li
1-5753-8694
al logit model with nested consideration sets. In this choice model, there are multiple customer types, and a customer of a particula
01-7008-253X
002-8123-5009
001-9410-0392; Zhou, Yuan/0009-0008-1706-6539
0003-1299-3196; Bai, Yicheng/0000-0003-2039-939X
aat/0000-0001-9584-4203; Cao, Yufeng/0000-0002-9183-0215
001-9755-7064
fixed revenue associated with each product. There are multiple customer types. Customers of different types choose according t
1-5753-8694
3-3414-9682
000-0002-9664-3750; Rusmevichientong, Paat/0000-0001-9584-4203
000-0003-0108-2936; Abeliuk, Andres/0000-0002-8158-4647; Cebrian, Manuel/0000-0002-3681-7982
7001-2240; Gao, Pin/0000-0001-7434-7902; Rusmevichientong, Paat/0000-0001-9584-4203
0000-0003-4538-8312; Shmoys, David/0000-0003-3882-901X
0003-1299-3196
0-0001-9269-633X; Leitner, Markus/0000-0002-3313-9610; Sole, Claudio/0000-0002-2144-2137; Roberti, Roberto/0000-0002

2-9812-6140; Levi, Retsef/0000-0002-1994-4875
001-6719-3212
0-0003-0335-8836; den Boer, Arnoud/0000-0003-4779-0436
001-9410-0392; Zhou, Yuan/0009-0008-1706-6539
e customers arrive sequentially and make purchasing decisions following the multinomial logit (MNL) choice model. Not knowing
hoose pairwise disjoint sets of assortments to offer across a series of T stages. Arriving customers begin their search proces
logit choice model. The novel aspect of our formulations is that the true parameters of the logit model are assumed to be unkno
(1979) [Daganzo C (1979) Multinomial Probit: The Theory and Its Application to Demand Forecasting (Academic Press, New York).]
002-1414-107X
1-6407-834X
el with sequential offerings recently proposed by Liu et al. [INFORMS J. Comput., 2020] to capture a multitude of applications
00-0003-0083-4737; Miranda Bront, Juan Jose/0000-0001-9125-7028
0-0003-0335-8836
2-9812-6140
01-9860-5419; Li, Hongmin/0000-0002-1107-6348; Webster, Scott/0000-0002-4086-8088; Mason, Andrew Nicholas/0009-00
ider revenue maximization and ignore the trade-offs between revenue and market share. To address this challenge, we develop
fers a subset (assortment) of N substitutable products to a consumer, who selects one of these products according to a multinomia
0-0002-1849-7276; Cao, Yufeng/0000-0002-9183-0215; Wang, He/0000-0001-7444-2053

0002-0241-0244
cally, we con -sider a dynamic set optimization problem, where a decision-maker offers a subset (assortment) of prod-ucts to
002-5887-8938
000-0003-2812-3451
001-9410-0392
0000-0002-9812-6140
001-9410-0392
0002-4086-8088
llers to promote their products by charging them for the right to be displayed on top of organic search results. In this paper, we s
001-9410-0392
0002-0559-8027
2-9812-6140
1-5233-4385
0002-5236-2375
ding to a nonparametric choice model. Each customer arrives with a preference list and will purchase the highest-ranking offered prod
re customers are allocated to their highest utility option, as a heuristic or starting point for the Multinomial Logit (MNL) model
s such as retailing and online advertising. The fundamental goal is to select a subset of items to offer from a universe of s
a make -to -batch -order (MTBO) system, on consumer choice behavior, pricing, assortment, and model estimation. In an MTBO
-0002-2090-992X; Maier, Sebastian/0000-0001-6162-0906; Vasilyev, Andrey/0000-0001-5014-537X
t of products to offer to consumers in order to maximise revenue. A simple and natural strategy is to select the best assortment ou
0-0002-5168-2078
0002-0559-8027
Victor/0000-0001-8391-2205; Kunnumkal, Sumit/0000-0002-6832-0508
various other fields, the Mallows model has only recently been examined from revenue management perspectives. To our k
9-0005-2681-6598
-0003-0100-8154; Liu, Bin/0000-0002-3946-8124; Zhao, Xiujie/0000-0003-3450-5480
00-0003-4779-0436
en a variety of substitutable goods. We investigate the relationship between two well studied choice models, the Nested Logit (N
0000-0001-7429-8477
02-3721-5107
0-0001-8175-7117
0003-0828-7280
0-0001-5443-4144
000-0002-9664-3750; Blanchet, Jose/0000-0001-5895-0912
02-1107-6348
0000-0001-7490-5396
-0003-3668-0653
0000-0002-9812-6140
0002-0559-8027
02-1906-6777; Chinnam, Ratna Babu/0000-0003-0980-1544
0002-1495-2614; Cetin, Oguz/0000-0003-0088-9690
capture the stochastic choice behavior of consumers. One advantage of the random consideration set choice model is that it
00-0002-0534-6858; Natarajan, Karthik/0000-0002-3868-7587
l multi-product pricing problems as tractable convex optimization problems. We consider a retailer offering an assortment of diff
r/0000-0001-8144-6394; Perez, Juan/0000-0003-3640-2514; Perez, Juan/0000-0001-8592-1797
0003-0828-7280
oking consumers. Assuming that the consumer's future utility for each product alternative can be characterized by a standard ra
002-6643-6865; Wang, Ruxian/0000-0002-0559-8027
cía/0000-0002-7027-001X; Perez, Juan/0000-0003-3640-2514
002-6290-0229
0002-0559-8027
f optimally balancing the expected return on product investment with the revenue or profit risk associated with uncertain customer ch
display to customers landing on Alibaba's two online marketplaces, Tmall and Taobao. We conducted a large-scale field exper
of numbers in a subset and the denominator is the product of numbers in the same subset. Unlike the sum-sum ratio problem, w
0-0003-2110-7088; Lei, Yanzhe (Murray)/0000-0003-2292-7336
0002-5880-6221
d the profit-only objective becomes inadequate. Our paper is the first to consider the dual objective of profit and consumer sur
002-3406-2133; Haase, Knut/0000-0002-8587-0739
000-0003-0108-2936
0003-1608-6403; Kunnumkal, Sumit/0000-0002-6832-0508
n and pricing problem with a fixed cost factor. We adopt the multinomial logit model to estimate the sales of each marketed pro
0000-0003-4538-8312; Mak, Ho-Yin/0000-0002-4289-8029
1-6407-834X
0003-1608-6403
000-0003-0108-2936
0-0002-8258-9116; Barbier, Thibault/0000-0003-1268-5871
002-6290-0229
000-0002-9664-3750
ISSN eISSN ISBN Journal AbbJournal IS Publication Publication Volume Issue Part Numb
0167-6377 NOV 2012 40 6
0167-6377 1872-7468 SEP 2019 47 5
0030-364X JUL-AUG 2023 71 4
0894-069X 1520-6750 2024 APR 2024
0894-069X 1520-6750 OCT 2022 69 7
0377-2217 1872-6860 MAR 16 2019 273 3
0894-069X 1520-6750 OCT 2023 70 7
0167-6377 1872-7468 MAR 2015 43 2
0030-364X JUL-AUG 2018 66 4
0167-6377 1872-7468 NOV 2019 47 6
0030-364X MAR-APR 2018 66 2
1059-1478 1937-5956 NOV 2014 23 11
1091-9856 1526-5528 SUM 2020 32 3
1059-1478 1937-5956 JAN 2016 25 1
0364-765X 1526-5471 NOV 2021 46 4
0030-364X 2023 JUN 2023
0030-364X MAR-APR 2023 71 2
2472-5854 2472-5862 APR 3 2021 53 4
1059-1478 1937-5956 OCT 2015 24 10
1523-4614 1526-5498 MAR-APR 2022 24 2
0167-6377 1872-7468 JAN 2019 47 1
0025-1909 1526-5501 MAY 2021 67 5
1619-4500 1614-2411 MAR 2016 14 1
0030-364X SEP-OCT 2021 69 5
0030-364X NOV-DEC 2010 58 6
0030-364X 2023 OCT 2023
1059-1478 1937-5956 MAY-JUN 2007 16 3
1091-9856 1526-5528 2023 NOV 2023
0030-364X SEP-OCT 2018 66 5
0030-364X MAR-APR 2022 70 2
0030-364X 2022 FEB 2022
1059-1478 1937-5956 JAN 2021 30 1
1523-4614 1526-5498 MAR-APR 2021 23 2
1059-1478 1937-5956 NOV 2023 32 11
0030-364X JUL-AUG 2012 60 4
0030-364X JAN-FEB 2016 64 1
0030-364X 2024 MAR 2024
0167-6377 1872-7468 JAN 2022 50 1
0030-364X JUL-AUG 2022 70 4
0166-218X 1872-6771 FEB 19 2014 164 1
0269-9648 1469-8951 OCT 2022 36 4
0025-1909 1526-5501 JUN 2021 67 6
1523-4614 1526-5498 WIN 2019 21 1
0160-5682 1476-9360 DEC 2 2023 74 12
0030-364X SEP-OCT 2019 67 5
0969-6989 1873-1384 SEP 2020 56
0030-364X JUL-AUG 2022 70 4
1059-1478 1937-5956 FEB 2019 28 2
0377-2217 1872-6860 OCT 16 2023 310 2
0377-2217 1872-6860 DEC 16 2022 303 3
1366-5545 1878-5794 FEB 2024 182
0030-364X 2023 AUG 2023
0025-1909 1526-5501 APR 2023 69 4
2076-3417 APR 27 2023 13 9
1532-4435 2020 21
1523-4614 1526-5498 SEP-OCT 2020 22 5
0025-1909 1526-5501 AUG 2023 69 8
0167-6377 1872-7468 SEP 2018 46 5
1523-4614 1526-5498 SUM 2018 20 3
0025-1909 1526-5501 JUL 2023 69 5
1523-4614 1526-5498 SEP-OCT 2022 24 5
0167-6377 1872-7468 JUL 2022 50 4
1523-4614 1526-5498 SUM 2018 20 3
0254-5330 1572-9338 SEP 2020 292 1
0025-1909 1526-5501 FEB 2020 66 2
1523-4614 1526-5498 2024 FEB 2024
0377-2217 1872-6860 APR 1 2023 306 1
0178-4617 1432-0541 APR 2020 82 4
0360-8352 1879-0550 AUG 2023 182
0030-364X JUL-AUG 2021 69 4
0030-364X MAR-APR 2019 67 2
0025-5610 1436-4646 2023 DEC 2023
0025-1909 1526-5501 APR 2023 69 4
0969-6989 1873-1384 JAN 2024 76
0377-2217 1872-6860 NOV 16 2020 287 1
0025-1909 1526-5501 OCT 2022 68 10
0167-6377 1872-7468 JUL 2023 51 4
1545-8490 1545-8504 MAR 2024 21 1
0925-5273 1873-7579 NOV 2023 265
1523-4614 1526-5498 SEP-OCT 2021 23 5
0377-2217 1872-6860 JUL 16 2022 300 2
0030-364X MAR-APR 2016 64 2
0025-1909 1526-5501 JUL 2022 68 7
0030-364X JUL-AUG 2016 64 4
0030-364X SEP-OCT 2017 65 5
0925-5273 1873-7579 SEP 2022 251
0030-364X MAR-APR 2017 65 2
0030-364X JUL-AUG 2023 71 4
1523-4614 1526-5498 JAN-FEB 2022 24 1
0160-5682 1476-9360 2018 69 11
1523-4614 1526-5498 MAY-JUN 2020 22 3
0167-6377 1872-7468 MAR 2024 53
0018-9286 1558-2523 OCT 2012 57 10
0025-5610 1436-4646 JUN 2014 145 1-2
2227-7390 OCT 2022 10 19
0894-069X 1520-6750 MAR 2021 68 2
0025-1909 1526-5501 MAY 2018 64 5
1523-4614 1526-5498 JAN-FEB 2022 24 1
0377-2217 1872-6860 SEP 16 2021 293 3
0740-817X 1545-8830 JUN 2016 48 6
1523-4614 1526-5498 JAN-FEB 2022 24 1
0030-364X NOV-DEC 2023 71 6
0030-364X JAN-FEB 2022 70 1
0167-6377 1872-7468 MAY 2016 44 3
1523-4614 1526-5498 MAY-JUN 2022 24 3
0030-364X JUL-AUG 2023 71 4
1059-1478 1937-5956 APR 2023 32 4
0167-6377 1872-7468 MAY 2016 44 3
0025-1909 1526-5501 JUN 2022 68 6
0041-1655 NOV-DEC 2019 53 6
1862-4472 1862-4480 MAR 2019 13 2
0894-069X 1520-6750 DEC 2020 67 8
0377-2217 1872-6860 NOV 1 2023 310 3
1059-1478 1937-5956 JUL 2021 30 7
0926-6003 1573-2894 MAY 2019 73 1
0377-2217 1872-6860 DEC 16 2021 295 3
0377-2217 1872-6860 NOV 1 2020 286 3
0377-2217 1872-6860 JAN 2020 280 1
0030-364X JAN-FEB 2020 68 1
SupplemenSpecial Iss Meeting AbStart Page End Page Article Nu DOI DOI Link Book DOI Early Acce
492 497 10.1016/j.ohttp://dx.doi.org/10.1016/j.orl.2012.08.003
1197 1215 10.1287/ophttp://dx.doi.org/10.1 OCT 2022
10.1002/nahttp://dx.doi.org/10.1 APR 2024
927 938 10.1002/nahttp://dx.doi.org/10.1 MAY 2022
1052 1064 10.1016/j.ehttp://dx.doi.org/10.1016/j.ejor.2018.08.047
653 674 10.1002/nahttp://dx.doi.org/10.1 APR 2023
994 1003 10.1287/ophttp://dx.doi.org/10.1287/opre.2017.1703
2023 2039 10.1111/p http://dx.doi.org/10.1111/poms.12191
835 853 10.1287/ij http://dx.doi.org/10.1287/ijoc.2019.0910
1639 1657 10.1287/mohttp://dx.doi.org/10.1287/moor.2021.1133
10.1287/ophttp://dx.doi.org/10.1 JUN 2023
603 625 10.1287/ophttp://dx.doi.org/10.1 SEP 2022
453 471 10.1080/2 http://dx.doi.org/10. SEP 2020
1220 1240 10.1287/m http://dx.doi.org/10. DEC 2021
2845 2869 10.1287/m http://dx.doi.org/10.1287/mnsc.2020.3657
57 75 10.1007/s1http://dx.doi.org/10.1007/s10288-015-0302-y
10.1287/ophttp://dx.doi.org/10.1 OCT 2023
369 380
10.1287/ij http://dx.doi.org/10.1 NOV 2023
10.1287/ophttp://dx.doi.org/10.1 FEB 2022
85 102 10.1111/p http://dx.doi.org/10. NOV 2020
525 545 10.1287/m http://dx.doi.org/10.1287/msom.2019.0857
3374 3393 10.1111/p http://dx.doi.org/10. JUL 2023
10.1287/ophttp://dx.doi.org/10.1 MAR 2024
8 15 10.1016/j.ohttp://dx.doi.org/10.10 NOV 2021
10.1287/ophttp://dx.doi.org/10.1 FEB 2022
SI 246 263 10.1016/j. http://dx.doi.org/10.1016/j.dam.2012.03.003
1266 1274 10.1017/S http://dx.doi.org/10 SEP 2021
2545 2557 10.1080/0 http://dx.doi.org/10. DEC 2022
102152 10.1016/j. http://dx.doi.org/10.1016/j.jretconser.2020.102
10.1287/ophttp://dx.doi.org/10.1 MAR 2022
737 750 10.1016/j.ehttp://dx.doi.org/10.10 MAY 2023
1027 1043 10.1016/j.ehttp://dx.doi.org/10.10 JUL 2022
103413 10.1016/j. http://dx.doi.org/10.1 JAN 2024
10.1287/ophttp://dx.doi.org/10.1 AUG 2023
2069 2087 10.1287/m http://dx.doi.org/10. OCT 2022
5441 10.3390/a http://dx.doi.org/10.3390/app13095441
216
4668 4684 10.1287/m http://dx.doi.org/10. NOV 2022
2814 2832 10.1287/m http://dx.doi.org/10. JUL 2022
SI 2741 2760 10.1287/m http://dx.doi.org/10. JUL 2022
399 406 10.1016/j.ohttp://dx.doi.org/10.10 JUN 2022
553 573 10.1007/s1http://dx.doi.org/10.1007/s10479-019-03300-4
10.1287/m http://dx.doi.org/10. FEB 2024
207 226 10.1016/j.ehttp://dx.doi.org/10.10 DEC 2022
681 720 10.1007/s0http://dx.doi.org/10.1007/s00453-019-00610-8
109328 10.1016/j. http://dx.doi.org/10.1 JUN 2023
10.1007/s1http://dx.doi.org/10. DEC 2023
2088 2105 10.1287/m http://dx.doi.org/10. JUN 2022
103603 10.1016/j. http://dx.doi.org/10.1 OCT 2023
7480 7496 10.1287/m http://dx.doi.org/10. MAR 2022
461 467 10.1016/j.ohttp://dx.doi.org/10.10 JUL 2023
10.1287/dehttp://dx.doi.org/10.1 JUL 2023
109010 10.1016/j. http://dx.doi.org/10.1 AUG 2023
561 570 10.1016/j.ehttp://dx.doi.org/10.10 MAR 2022
5002 5024 10.1287/m http://dx.doi.org/10. NOV 2021
108550 10.1016/j. http://dx.doi.org/10.1 JUL 2022
1216 1249 10.1287/ophttp://dx.doi.org/10.1 NOV 2022
1834 1853 10.1057/s4http://dx.doi.org/10.1057/s41274-017-0287-3
107070 10.1016/j. http://dx.doi.org/10.1 JAN 2024
2450 2463 10.1109/T http://dx.doi.org/10.1109/TAC.2012.2211175
223 261 10.1007/s1http://dx.doi.org/10.1007/s10107-013-0646-z
3600 10.3390/m http://dx.doi.org/10.3390/math10193600
159 182 10.1002/nahttp://dx.doi.org/10.1 SEP 2020
430 447 10.1287/m http://dx.doi.org/10. FEB 2021
1168 1187 10.1016/j.ehttp://dx.doi.org/10.10 APR 2021
541 554 10.1080/0 http://dx.doi.org/10.1080/0740817X.2015.1078
10.1287/ophttp://dx.doi.org/10.1 MAY 2023
1529 1546 10.1287/m http://dx.doi.org/10. AUG 2021
1154 1170 10.1287/ophttp://dx.doi.org/10.1 SEP 2022
1223 1242 10.1111/p http://dx.doi.org/10. JAN 2023
4005 4023 10.1287/m http://dx.doi.org/10. DEC 2021
1591 1608 10.1287/tr http://dx.doi.org/10.1287/trsc.2018.0867
367 378 10.1007/s1http://dx.doi.org/10.1007/s11590-018-1356-5
SI 595 616 10.1002/nahttp://dx.doi.org/10.1 OCT 2020
1128 1150 10.1016/j.ehttp://dx.doi.org/10.10 JUN 2023
2143 2161 10.1111/p http://dx.doi.org/10. MAR 2021
275 310 10.1007/s1http://dx.doi.org/10.1007/s10589-019-00068-y
1025 1041 10.1016/j.ehttp://dx.doi.org/10.10 AUG 2021
Number of WoS CategWeb of Sci Research AIDS NumbePubmed Id Open AccesHighly Cite Hot Paper Date of Exp
016/j.orl.2012.08.003
016/j.orl.2019.07.010
OCT 2022
MAY 2022
016/j.ejor.2018.08.047
016/j.orl.2015.01.010
287/opre.2017.1703
016/j.orl.2019.09.009
287/opre.2017.1672
111/poms.12191
287/ijoc.2019.0910
111/poms.12402
287/moor.2021.1133
111/poms.12365
DEC 2021
016/j.orl.2018.11.006
287/mnsc.2020.3657
007/s10288-015-0302-y
287/opre.2021.2127
287/opre.1100.0866
OCT 2023
NOV 2023
287/opre.2018.1734
OCT 2021
NOV 2020
287/msom.2019.0857
287/opre.1120.1063
287/opre.2015.1459
MAR 2024
NOV 2021
016/j.dam.2012.03.003
287/mnsc.2020.3664
287/msom.2017.0675
DEC 2022
287/opre.2018.1832
016/j.jretconser.2020.102152
MAR 2022
111/poms.12916
MAY 2023
AUG 2023
OCT 2022
390/app13095441
287/msom.2019.0788
NOV 2022
016/j.orl.2018.08.006
287/msom.2017.0688
287/msom.2017.0662
007/s10479-019-03300-4
287/mnsc.2018.3230
DEC 2022
007/s00453-019-00610-8
287/opre.2020.2059
287/opre.2018.1771
DEC 2023
OCT 2023
016/j.ejor.2020.05.012
MAR 2022
AUG 2023
287/msom.2020.0878
MAR 2022
287/opre.2016.1487
NOV 2021
287/opre.2016.1505
287/opre.2017.1614
287/opre.2016.1570
NOV 2022
MAR 2021
057/s41274-017-0287-3
287/msom.2018.0749
109/TAC.2012.2211175
007/s10107-013-0646-z
390/math10193600
287/mnsc.2017.2729
080/0740817X.2015.1078524
MAR 2021
MAY 2023
OCT 2021
016/j.orl.2016.03.016
AUG 2021
016/j.orl.2016.03.013
DEC 2021
287/trsc.2018.0867
007/s11590-018-1356-5
OCT 2020
MAR 2021
007/s10589-019-00068-y
AUG 2021
016/j.ejor.2020.04.042
016/j.ejor.2019.05.043
287/opre.2019.1875
UT (Uniqu Web of Science Record
WOS:0003 View Full Record in Web of Science

Savedrecs

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Savedrecs

Uploaded by

Copyright:

Available Formats

Publicatio Authors Book AuthoBook Edito Book GroupAuthor Ful Book AuthoGroup AuthArticle TitleSource Titl

J Wang, RX Wang, Ruxian CapacitatedOPERATIONS RESEAR

0-0001-9269-633X; Leitner, Markus/0000-0002-3313-9610; Sole, Claudio/0000-0002-2144-2137; Roberti, Roberto/0000-0002

0-0002-1849-7276; Cao, Yufeng/0000-0002-9183-0215; Wang, He/0000-0001-7444-2053

You might also like