Zobrazeno 1 - 10
of 112
pro vyhledávání: '"Huseyin Topaloglu"'
Publikováno v:
Stochastic Systems, Vol 3, Iss 2, Pp 322-361 (2014)
In this paper we consider approximate dynamic programming methods for ambulance redeployment. We first demonstrate through simple examples how typical value function fitting techniques, such as approximate policy iteration and linear programming, may
Externí odkaz:
https://doaj.org/article/33e9f5b71846471f92458c816239b8ed
Publikováno v:
Operations Research. 71:603-625
Discrete choice models have recently attracted significant attention to model demand in revenue-management applications, as they can capture the fact that if a product is unavailable, then some customers substitute for this product, whereas others le
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c11d0ec0cad64565530c58c05f3e477d
https://doi.org/10.1287/opre.2022.2333
https://doi.org/10.1287/opre.2022.2333
Autor:
Yicheng Bai, Omar El Housni, Billy Jin, Paat Rusmevichientong, Huseyin Topaloglu, David P. Williamson
Publikováno v:
Management Science.
One of the most prevalent demand models in the revenue management literature is based on dividing the selling horizon into a number of time periods such that there is at most one customer arrival at each time period. This demand model is equivalent t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0ea9e5dc2778982284aacfcb3e6b3dd4
https://doi.org/10.1287/mnsc.2023.4769
https://doi.org/10.1287/mnsc.2023.4769
Publikováno v:
Operations Research.
There are a variety of revenue management systems that require making pricing or availability decisions for unique resources. For example, lodging marketplaces, boutique hotels, and bed-and-breakfasts offer unique rooms, apartments, or houses. Matchi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c95520ff34214ffed6334d0f96a219ad
https://doi.org/10.1287/opre.2022.2427
https://doi.org/10.1287/opre.2022.2427
Publikováno v:
SSRN Electronic Journal.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a75e3518009e76d887dee21fb84f0f7c
https://doi.org/10.2139/ssrn.4417593
https://doi.org/10.2139/ssrn.4417593
Autor:
Yuhang Ma, Ningyuan Chen, Paat Rusmevichientong, Pin Gao, Anran Li, Huseyin Topaloglu, Guillermo Gallego
Publikováno v:
Operations Research. 69:1509-1532
Sequential Recommendation Under the Multinomial Logit Model with Impatient Customers In many applications, customers incrementally view a subset of offered products and make purchasing decisions before observing all the offered products. In this case
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5a8e36ae0ecc98c7a819765158880215
https://doi.org/10.1287/opre.2021.2127
https://doi.org/10.1287/opre.2021.2127
Publikováno v:
Management Science. 67:2845-2869
We examine the revenue–utility assortment optimization problem with the goal of finding an assortment that maximizes a linear combination of the expected revenue of the firm and the expected utility of the customer. This criterion captures the trad
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4f93b09739320a67cc14b4369fac8469
https://doi.org/10.1287/mnsc.2020.3657
https://doi.org/10.1287/mnsc.2020.3657
Publikováno v:
INFORMS Journal on Computing. 32:835-853
We consider assortment optimization problems, where the choice process of a customer takes place in multiple stages. There is a finite number of stages. In each stage, we offer an assortment of products that does not overlap with the assortments offe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ed9f3e81b607c50b35f003f6365492eb
https://doi.org/10.1287/ijoc.2019.0910
https://doi.org/10.1287/ijoc.2019.0910
Publikováno v:
Management Science. 66:2820-2844
We consider dynamic assortment problems with reusable products, in which each arriving customer chooses a product within an offered assortment, uses the product for a random duration of time, and returns the product back to the firm to be used by oth
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::352ddd10f8422ae7ebf5417c1cb77485
https://doi.org/10.1287/mnsc.2019.3346
https://doi.org/10.1287/mnsc.2019.3346
Publikováno v:
Operations Research. 68:741-761
We consider uncapacitated and capacitated assortment problems under the paired combinatorial logit model, where the goal is to fi nd a set of products to maximize the expected revenue obtained from each customer. In the uncapacitated setting, we can
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bebef5dccb4a7eb7a723366e94a02e42
https://doi.org/10.1287/opre.2019.1930
https://doi.org/10.1287/opre.2019.1930