The following pages link to O. A. Emets (Q557442):
Displaying 16 items.
- Solving linear optimization problems on arrangements by the truncation method (Q557443) (← links)
- Construction of convex continuations for functions defined on a hypersphere (Q1280936) (← links)
- A mathematical interval model of a combinatorial problem of packing of color rectangles (Q1407143) (← links)
- Solution of a Euclidean combinatorial optimization problem by the dynamic-programming method (Q1407352) (← links)
- Solution of optimization problems with fractional-linear objective functions and additional linear constraints on permutations (Q1780260) (← links)
- The optimization of linear and convex functions on an Euclidean combinatorial set of polypermutations (Q1903908) (← links)
- Solution of Euclidean combinatorial optimization problems by the method of construction of a lexicographic equivalence (Q2574244) (← links)
- (Q3713066) (← links)
- (Q4455983) (← links)
- (Q4798077) (← links)
- An irreducible set of combinatorial polyhedron constraints in the linear-fractional optimisation problem on permutations (Q4809514) (← links)
- (Q4831941) (← links)
- Extremal properties of nondifferentiable convex functions on euclidean sets of combinations with repetitions (Q4866469) (← links)
- (Q4955990) (← links)
- (Q5317963) (← links)
- Classes of lexicographic equivalence in Euclidean combinatorial optimisation on arrangements (Q5439037) (← links)