Search Results - V. A. Bondarenko

We provide an effective description of graphs of polyhedra for GRAPH PARTITIONING and COMPLETE BIPARTITE SUBGRAPH problems. We establish the fact, that the clique number for each of this problems increases exponentially with the dimension of the space.

The integrality recognition problem is considered on the sequence Mn,k of the nested Boolean quadric polytope relaxations, including the rooted semimetric Mn and the metric Mn,3 polytopes. Constraints of the metric polytope cut off all faces of the rooted semimetric polytope, containing only fractio...

Full description

In this paper, we study polyhedral properties of two spanning tree problems with additional constraints. In the first problem, it is required to find a tree with a minimum sum of edge weights among all spanning trees with the number of leaves less than or equal to a given value. In the second proble...

Full description

Purpose: Show the ability to handle the stump of the duodenum using the entire thickness of the round ligament of liverMaterials and Methods: For treatment of the stump of the duodenum during surgery for gastric resection with Billroth II penetrating into the head of the pancreas or liver gates ulce...

Full description

Analysis of surgical treatment of 106 patients with ulcerative gastroduodenal hemorrhage arising in the presence of pyloroduodenal stenosis of varying severity. The patients were divided into 2 groups: 50 people, made a comparison group received traditional surgical treatment, and 56 people. A group...

Full description