We study the multiple objective discrete optimization (MODO) problem and propose two-stage optimization problems as subproblems to be solved to obtain efficient solutions. The mathematical structure ...

To improve tractability, we investigate the linear programming-based approach to approximate dynamic programming. This approach can provide both feasible control policies and bounds on the MDPs' ...

It covers basic algorithm design techniques such as divide and conquer, dynamic programming, and greedy algorithms. It concludes with a brief introduction to intractability (NP-completeness) .

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

Dan Zhang, Daniel Adelman, An Approximate Dynamic Programming Approach to Network Revenue Management with Customer Choice, Transportation Science, Vol. 43, No. 3 (August 2009), pp. 381-394 ...