GEOMETRY OF COMBINATORIAL POLYHEDRONS

The properties of the combinatorial optimization problems by the geometric methods have been studied. The theorem about canonic type of the functional with small variety of the values has been proved, the new polynomial-integrable subclass of the travelling salesman problem has been constructed, the problem about achievement of the average functional value on any local minimum and about presence of the interval between average value and maximal one of the local minima have been investigatedAvailable from VNTIC / VNTIC - Scientific & Technical Information Centre of RussiaSIGLERURussian Federatio