This paper considers a minimum-cost network flow problem in a bipartite graph with a single sink. The transportation costs exhibit a staircase cost structure because such types of transportation cost ...

We introduce a novel approach to solving dynamic programming problems, such as those in many economic models, on a quantum annealer, a specialized device that performs combinatorial optimization.

World Finals held in Baku, Azerbaijan, Google's Gemini 2.5 Deep Think artificial intelligence system achieved a historic breakthrough. In this premier competition that brought together 139 top ...

In this competition, the advanced version of “Gemini 2.5 Deep Seek” participated remotely online and solved 10 out of 12 ...

In a remarkable achievement for artificial intelligence, Gemini 2.5 Deep Think has secured a gold-medal level performance at the 2025 International Collegiate Programming Contest (ICPC) World Finals.

Gemini's solutions for this year's ICPC were scored by the event coordinators, but Google also turned Gemini 2.5 loose on ...

After a mathematics win in July, Gemini 2.5 Deep Think has now scored a gold-medal level performance in competitive coding.

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

This course covers reinforcement learning aka dynamic programming, which is a modeling principle capturing dynamic environments and stochastic nature of events. The main goal is to learn dynamic ...