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 ...

View on Coursera Course Description This course is part three of a specialization on algorithms and data structures. It covers basic algorithm design techniques such as divide and conquer, dynamic ...

Earl E. Bomberger, A Dynamic Programming Approach to a Lot Size Scheduling Problem, Management Science, Vol. 12, No. 11, Series A, Sciences (Jul., 1966), pp. 778-784 ...

A dynamic programming approach is proposed to select optimally among a given set of products and allocate integer shelf-space units to the selected products in supermarkets. The approach is designed ...

Julia is a free open source, high-level, high-performance, dynamic programming language for numerical computing. It has the development convenience of a dynamic language with the performance of a ...

We introduce a new model of school choice with reserves in which a social planner is constrained by a limited supply of reserve seats and tries to find an optimal matching according to a social ...