Dynamic stochastic matching problems arise in a variety of recent applications, ranging from ridesharing and online video games to kidney exchange. Such problems are naturally formulated as Markov ...
We present an Approximate Dynamic Programming (ADP) approach for the multidimensional knapsack problem (MKP). We approximate the value function (a) using parametric and nonparametric methods and (b) ...
The practice of offering discounts to prospective customers represents a rudimentary form of using transaction history measures to customize the marketing mix. Furthermore, the proliferation of ...
Researchers at the Regensburg Center for Biochemistry (RCB) and the Regensburg Center for Ultrafast Nanoscopy (RUN) at the University of Regensburg are obtaining unique insights into the structure, ...
Dan Zhang and Larry Weatherford. 2017. Dynamic Pricing for Network Revenue Management: A New Approach and Application in the Hotel Industry. INFORMS Journal on Computing, 29(1): 18-35. Dynamic pricing ...
Chemists have developed a strategy using disulfide-containing small molecules to facilitate the reversible control and delivery of ribonucleic acid (RNA). A research team has developed a method that ...
Wang, Franklyn, Ravi Jagadeesan, and Scott Duke Kominers. "Optimizing Reserves in School Choice: A Dynamic Programming Approach." Operations Research Letters 47, no. 5 (September 2019): 438–446.
Researchers have developed a fundamentally new approach to DNA data storage systems, giving users the ability to read or modify data files without destroying them and making the systems easier to ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results