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

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

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