| 12:30 |
Edward Kh. Gimadi and Oxana Tsidulko |
On Modification of a Polynomial Asymptotically Optimal Algorithm for the Maximum Traveling Salesman Problem |
| 12:50 |
Michael Khachay and Yuri Ogorodnikov |
Efficient PTAS for the Euclidean CVRP with Time Windows |
| 13:10 |
Alexander Kelmanov, Vladimir Khandeev and Anna Panasenko |
Exact Algorithms for the Special Cases of Two Hard to Solve Problems of Searching for the Largest Subset |
| 13:30 |
Alexander Kelmanov, Ludmila Mikhailova and Semyon Romanchenko |
On a Problem of Summing Elements Chosen from a Family of Finite Numerical Sequences |
