activity
20172019
most cited2-neighborly 0/1-polytopes of dimension 7

2 citations · 2 across the 3 of their papers we have counts for

collaborators
Showing cs.DSShow all

1 paper · 1 filter

cs.DS2018

Branch and bound algorithm for the traveling salesman problem is not a direct type algorithm

Aleksandr Maksimenko

In this paper, we consider the notion of a direct type algorithm introduced by V.A. Bondarenko in 1983. A direct type algorithm is a linear decision tree with some special properti…