In 1960, Andrey Kolmogorov posed a seemingly impossible challenge at a seminar at Moscow State University: could there be a ...

A canonical problem in computer science is to find the shortest route to every point in a network. A new approach beats the classic algorithm taught in textbooks.

Tohoku University. "New algorithm optimizes quantum computing problem-solving." ScienceDaily. ScienceDaily, 10 April 2019. <www.sciencedaily.com / releases / 2019 / 04 / 190410095927.htm>.

This paper presents an exact algorithm for solving strategic and tactical multiperiod vehicle routing problems that can be modeled as period vehicle routing problems (PVRPs). The PVRP is defined on a ...

The author presents a rapidly convergent algorithm to solve the general portfolio problem of maximizing concave utility functions subject to linear constraints. The algorithm is based on an iterative ...