共 20 条
[1]
Bondarenko V.(2017)1-skeletons of the spanning tree problems with additional constraints Autom. Control Comput. Sci. 51 682-688
[2]
Nikolaev A.(2016)On graphs of the cone decompositions for the min-cut and max-cut problems Int. J. Math. Math. Sci. 2016 7863650-137
[3]
Shovgenov D.(2017)Some properties of the skeleton of the pyramidal tours polytope Electron. Notes Discrete Math. 61 131-585
[4]
Bondarenko V.(2017)Polyhedral characteristics of balanced and unbalanced bipartite subgraph problems Autom. Control Comput. Sci. 51 576-18
[5]
Nikolaev A.(2018)On the skeleton of the polytope of pyramidal tours J. Appl. Ind. Math. 12 9-1142
[6]
Bondarenko V.(1983)Nonpolynomial lowerbound of the traveling salesman problem complexity in one class of algorithms Autom. Remote Control 44 1137-130
[7]
Nikolaev A.(2014)Characteristics of complexity: clique number of a polytope graph and rectangle covering number Mod. Anal. Inf. Sist. 21 116-989
[8]
Bondarenko V.A.(1963)An algorithm for the traveling salesman problem Oper. Res. 11 972-45
[9]
Nikolaev A.V.(1974)The travelling salesman problem and a class of polyhedra of diameter two Math. Program 7 32-undefined
[10]
Shovgenov D.A.(undefined)undefined undefined undefined undefined-undefined