The following pages link to V. A. Bondarenko (Q393846):
Displaying 31 items.
- Combinatorial and geometric properties of the max-cut and min-cut problems (Q393848) (← links)
- A class of hypergraphs and vertices of cut polytope relaxations (Q416923) (← links)
- On a problem of integer optimization (Q926647) (← links)
- Nonpolynomial lower bounds for the complexity of the traveling salesman problem in a class of algorithms (Q1061620) (← links)
- The problem of intractability and analysis of heuristics in discrete optimization. I (Q1320831) (← links)
- Intractability and analysis of heuristics for discrete optimization. II (Q1320851) (← links)
- Polyhedra with high-density graphs and polynomial-time solvability of combinatorial optimization problems (Q1324027) (← links)
- On polyhedron graph density in problems of combinatorial optimization (Q1326866) (← links)
- Mark Alexandrovich Krasnosels'kiĭ (April 27, 1920 -- February 13, 1997) (Q1366401) (← links)
- Lexicographic optimization in multicriteria discrete problems (Q1883713) (← links)
- Combinatorial problem arising in chaotic control (Q1886200) (← links)
- On a recognition problem on cut polytope relaxations (Q2261801) (← links)
- Integral inequalities for Volterra's equation in a Banach space with a cone (Q2547700) (← links)
- On random 2-adjacent 0/1-polyhedra (Q3184529) (← links)
- (Q3320122) (← links)
- (Q3718762) (← links)
- (Q3883060) (← links)
- (Q4007500) (← links)
- (Q4094033) (← links)
- (Q4242473) (← links)
- (Q4316053) (← links)
- (Q4316056) (← links)
- (Q4530218) (← links)
- On the Skeleton of the Polytope of Pyramidal Tours (Q4553641) (← links)
- A remark on Sard’s theorem (Q4725361) (← links)
- (Q4864467) (← links)
- (Q4890614) (← links)
- Analysis of discrete optimization algorithms using incomplete information (Q5186729) (← links)
- (Q5610582) (← links)
- (Q5616406) (← links)
- (Q5660144) (← links)
