Dynamic optimization and optimal control problems form the backbone of numerous applications in engineering, economics and the natural sciences. These methodologies involve determining a time-varying ...

We develop a novel framework, the implicit hitting set approach, for solving a class of combinatorial optimization problems. The explicit hitting set problem is as follows: given a set U and a family ...

Theoretical physicists have proposed a scalable quantum computer architecture. The new model overcomes fundamental limitations of programmability in current approaches that aim at solving real-world ...

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.

Games can be easy to construct but difficult to solve due to current methods available for finding the Nash Equilibrium. This issue is one of many that face modern game theorists and those analysts ...