Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Soudipta Chakraborty"'
Publikováno v:
Naval Research Logistics (NRL). 70:3-20
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f2f56ee5ff7b2b3e5cfa39bd04a157fe
https://doi.org/10.1002/nav.22081
https://doi.org/10.1002/nav.22081
Publikováno v:
Manufacturing & Service Operations Management. 24:1664-1680
Problem definition: We analyze a firm that sells repeatedly to a customer population over multiple periods. Although this setting has been studied extensively in the context of dynamic pricing—selling the same product in each period at a varying pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d6b9b723ef13de48d235cdb52e380845
https://doi.org/10.1287/msom.2021.1025
https://doi.org/10.1287/msom.2021.1025
Autor:
Soudipta Chakraborty, Huseyin Gurkan
Publikováno v:
SSRN Electronic Journal.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::56a20f853108668943963c3f7e62b177
https://doi.org/10.2139/ssrn.4139424
https://doi.org/10.2139/ssrn.4139424
Publikováno v:
SSRN Electronic Journal.
Problem Definition: We analyze a firm that sells repeatedly to a customer population over multiple periods. While this setting has been studied extensively in the context of dynamic pricing—selling the same product in each period at a varying price
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9405d24b5e3ae6f6c6c90ee7f8040e54
https://doi.org/10.2139/ssrn.3489425
https://doi.org/10.2139/ssrn.3489425
Autor:
Soudipta Chakraborty, Robert Swinney
Publikováno v:
SSRN Electronic Journal.
In rewards-based crowdfunding, entrepreneurs solicit donations from a large number of individual contributors. If total donations exceed a prespecified funding target, the entrepreneur distributes non-monetary rewards to contributors; otherwise, thei
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d3e958d686e090b9b09b0e6b8625bdc8
https://doi.org/10.2139/ssrn.3240094
https://doi.org/10.2139/ssrn.3240094
Publikováno v:
Theoretical Computer Science. 555:9-22
We consider the ( n - 2 , n ) cyclical scheduling problem which assigns a shift of n - 2 consecutive periods among a total of n periods to workers. We solve this problem by solving a series of b-matching problems on a cycle of n vertices. Each vertex
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d2e81563873d5b6220e511d47bc9a306
https://doi.org/10.1016/j.tcs.2014.03.034
https://doi.org/10.1016/j.tcs.2014.03.034
Publikováno v:
WALCOM: Algorithms and Computation ISBN: 9783642360640
WALCOM
WALCOM
We consider the (n − 2,n) cyclical scheduling problem which assigns a shift of n − 2 consecutive periods among a total of n periods to workers. We solve this problem by solving a series of b-matching problems on a cycle of n vertices. Each vertex
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::624444714f2c90321396092067e04b57
https://doi.org/10.1007/978-3-642-36065-7_21
https://doi.org/10.1007/978-3-642-36065-7_21
