The Approximability of Assortment Optimization Under Ranking Preferences-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

The Approximability of Assortment Optimization Under Ranking Preferences

Published:2018-11 Issue:6 Volume:66 Page:1661-1669
ISSN:0030-364X
Container-title:Operations Research
language:en
Short-container-title:Operations Research

Author:

Aouad Ali¹^ORCID,Farias Vivek²,Levi Retsef²^ORCID,Segev Danny³^ORCID

Affiliation:

1. Operations Research Center, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139;

2. Sloan School of Management, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139;

3. Department of Statistics, University of Haifa, Haifa 31905, Israel

Publisher

Institute for Operations Research and the Management Sciences (INFORMS)

Subject

Management Science and Operations Research,Computer Science Applications

Reference26 articles.

1. Algorithms for Multi-product Pricing

2. Approximating the independence number via theϑ-function

3. A Markov Chain Approximation to Choice Modeling

4. A Column Generation Algorithm for Choice-Based Network Revenue Management

Cited by 60 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The Value of Robust Assortment Optimization Under Ranking-Based Choice Models;Management Science;2024-09-04

2. Constrained Assortment Optimization Under the Cross-Nested Logit Model;Production and Operations Management;2024-07-26

3. Pricing heterogeneous products to heterogeneous customers who buy sequentially;Annals of Operations Research;2024-07-03

4. Customer type discovery in hotel revenue management: a data mining approach;Journal of Revenue and Pricing Management;2024-04-05

5. Submodular Order Functions and Assortment Optimization;Management Science;2024-04-01

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3