The State Prize winner in the field of science and technology.
In the English-speaking journals I was published under the last names Iemets, Emets, Yemets, Iemetsa with initials O. O. or O. A.
Main publications:
I. V. Sergienko O. A. Iemets, O. A. Chernenko, “Solving the conditional optimization problem for a fractional linear objective function on a set of arrangements by the branch and bound method”, Cybernetics and Systems Analysis, 48:6 (2012), 832–836
O. O. Iemets, O. O. Yemets, “Solving a linear problem of Euclidean combinatorial optimization on arrangements with the constant sum of the elements”, Cybernetics and Systems Analysis, 48:4 (2012), 547–557
Oleg A. Iemets , Yelizaveta M. Yemets, Dmitriy N. Olhovskiy, “Method of Analysis of the Permutable Polyhedron Graph for Linear Conditional Optimization Problems with the Implementation for a Multiprocessor System”, Journal of Automation and Information Sciences, 44:6 (2012), 51–60
Oleg A. Yemets, Alexandra O. Yemets, “The Solution of a Minimization Problem of the Weighted Length of a Connecting Grid by Branch and Bound Method”, Journal of Automation and Information Sciences, 44:7 (2012), 22–33
Oleg A. Yemets, Natalya Yu. Ustian, “Investigation of Solutions of Linear Problems of Euclidean Combinatorial Optimization on Permutations with Additional Restrictions. Part ²–III”, Journal of Automation and Information Sciences, 43:3 (2011), 24–31; 43:10 (2011), 56–63; 44:2 (2012), 30–37
I. V. Sergienko O. A. Iemets, O. A. Chernenko, “Solving the conditional optimization problem for a fractional linear objective function on a set of arrangements by the branch and bound method”, Cybernetics and Systems Analysis, 48:6 (2012), DOI 10.1007/s10559-012-9462-3,Print ISSN 1060-0396, Online ISSN1573-8337 , 832-836 pp.
2.
Oleg A. Yemets, Alexandra O. Yemets, “The Solution of a Minimization Problem of the Weighted Length of a Connecting Grid by Branch and Bound Method”, Journal of Automation and Information Sciences, 44:7 (2012), ISSN Print: 1064-2315 , 22-33 pp.
3.
O. O. ªmets, O. V. Olkhovska, “Rozv’yazuvaniya kombinatornikh zadach igrovogo tipu z obmezhennyami-perestavlennyami u obokh gravtsiv: iteratsiinii metod”, Sistemni doslidzhennya ta informatsiini tekhnologi¿, 2012, no. 4, 80-93 , (na ukrainskom yazyke) http://dspace.nbuv.gov.ua/handle/123456789/50198
4.
O. A. Emets, O. A. Chernenko, Optimizatsiya drobno-lineinykh funktsii na razmescheniyakh, eds. akad. I.V. Sergienko, Nauk. dumka, Kiev, 2011 , 154 pp. Dostup: http://dspace.uccu.org.ua/handle/123456789/467
5.
O. Ο. ªmets, O. Ol-ra ªmets, Rozv’yazuvannya zadach kombinatorno¿ optimizatsi¿ na nechitkikh mnozhinakh, PUET, Poltava, 2011 , 239 pp., (na ukrainskom) http://dspace.uccu.org.ua/handle/123456789/352
6.
O. O. ªmets, T. O. Parfonova, Transportni zadachi kombinatornogo tipu: vlastivosti, rozv'yazuvannya, uzagalnennya, PUET, Poltava, 2011 , 174 pp., (na ukrainskom) http://dspace.uccu.org.ua/handle/123456789/353
7.
O. O. ªmets, O. O. Chernenko, Modeli evklidovo¿ kombinatorno¿ optimizatsi¿, PUET, Poltava, 2011 , 204 pp., (na ukrainskom) http://dspace.uccu.org.ua/handle/123456789/354
8.
O. A. Emets, N. G. Romanova, Optimizatsiya na poliperestanovkakh, eds. akad. I. V. Sergienko, Nauk. dumka, Kiev, 2010 , 105 pp. http://dspace.uccu.org.ua/handle/123456789/468
9.
O. A . Yemets, Ye. M. Yemets, “A modification of the method of combinatorial truncation in optimization problems over vertex-located sets”, Cybernetics and Systems Analysis, 45:5 (2009), 785-791 , Springer New York
O. A. Emets, T. N. Barbolina, Kombinatornaya optimizatsiya na razmescheniyakh, eds. akad. I.V.Sergienko, Nauk. dumka, Kiev, 2008 , 159 pp. http://dspace.uccu.org.ua/handle/123456789/473
11.
O. O. ªmets, V. P. Svitalka, Sistemnii analiz innovatsiinoï diyalnosti na pidpriºmstvakh gazovidobuvnï galuzi Ukraïni, eds. akad. ². V. Sergiºnko, Nauk. dumka, Kiev, 2008 , 202 pp., (na ukrainskom) http://dspace.uccu.org.ua/handle/123456789/472
12.
O. A. Yemets, N. Yu. Ustian, “Games with combinatorial constraints”, Cybernetics and Systems Analysis, 44:4 (2008), 575–581 http://link.springer.com/article/10.1007/s10559-008-9028-6
Oleg O. ªmets, Oleksandra O. ªmets, “Operatsi¿ ta vidnoshennya nad nechitkimi chislami”, Naukovi visti NTUU «KP²», 2008, no. 5, 39-46 , NTUU" Kyiv Polytechnic Institute" (na ukrainskom)
15.
O. A. Emets, T. N. Barbolina, “Classes of lexicographic equivalence in Euclidean combinatorial optimisation on arrangements”, Discrete Math. Appl., 17:1 (2007), 77–86
16.
O. O. ªmets, O. V. Roskladka, Zadachi optimizatsi¿ na polikombinatornikh mnozhinakh: vlastivosti ta rozv’yazuvannya, RVTs PUSKU, Poltava, 2006 , 129 pp., (na ukrainskom) http://dspace.uccu.org.ua/handle/123456789/377
17.
O. A . Yemets, T. N . Barbolina, O. A . Chernenko, “Solving optimization problems with linear-fractional objective functions and additional constraints on arrangements”, Cybernetics and Systems Analysis, 42:5 (2006), 680-685
Oleg A. Emets, Natalya Yu. Ustian, “Solving of some problems of combinatorial optimization on arrangements and permutations of game type”, Journal of Automation and Information Sciences, 38:5 (2006), 34-45 , Begel House Inc.
T. N. Barbolina, O. A. Emets, “An all-integer cutting method for linear constrained optimization problems on arrangements”, Comput. Math. Math. Phys., 45:2 (2005), 243–250
20.
O. O. ªmets, L. M. Kolºchkina, Zadachi kombinatorno¿ optimizatsiya z drobovo-liniinimi funktsiyami, eds. akad. ².V.Sergiºnko, Nauk. dumka,, Ki¿v, 2005 , 117 pp., (na ukrainskom) http://dspace.uccu.org.ua/handle/123456789/474
21.
Yu. G. Stoyan, O. O. ªmets, ª. M. ªmets, Optimizatsiya na polirozmischennyakh: teoriya ta metodi, RVTs PUSKU, Poltava, 2005 , 103 pp., (na ukrainskom) http://dspace.uccu.org.ua/handle/123456789/376
22.
O. A. Valuiskaya, O. A. Emets, N. G. Romanova, “Stoyan–Yakovlev's modified method applied to convex continuation of polynomials defined on polypermutations”, Comput. Math. Math. Phys., 42:4 (2002), 566–570
23.
O. A. Emets, S. I. Nedobachii, L. N. Kolechkina, “An irreducible system of constraints of a combinatorial polyhedron in a linear-fractional optimization problem on permutations”, Discrete Math. Appl., 11:1 (2001), 95–103
24.
O. O. ªmets, ª. M. ªmets, “Vidsikannya v liniinikh chastkovo kombinatornikh zadachakh evklidovo¿ kombinatorno¿ optimizatsi¿”, Dopovidi NAN Ukra¿ni, 2000, no. 9, 105-109 (na ukrainskom yazyke)
25.
O. O. ªmets, L. M. Kolºchkina, S. ². Nedobachii, Doslidzhennya oblastei viznachennya zadach evklidovo¿ kombinatorno¿ optimizatsi¿ na perestavnikh mnozhinakh, ChPKP “Legat”, Poltava, 1999 , 64 pp., Ch.1, (na ukrainskom) http://dspace.uccu.org.ua/handle/123456789/488
26.
O. O. ªmets, L. M. Kolºchkina, S. ². Nedobachii, Doslidzhennya oblastei viznachennya zadach evklidovo¿ kombinatorno¿ optimizatsi¿ na perestavnikh mnozhinakh. Pro odnu zadachu optimizatsi¿ na perestavlennyakh, ChPKP “Legat”, Poltava, 1999 , 32 pp., Ch. 2, (na ukrainskom) http://dspace.uccu.org.ua/handle/123456789/486
27.
O. A. Emets, “Ob odnom metode otsecheniya dlya zadach kombinatornoi optimizatsii”, Ekonomika i matematicheskie metody (EMM), 33:4, Tsentralnyi Ekonomiko-Matematicheskii Institut (TsEMI) (1997), 120-129
28.
O. A. Emets, “The optimization of linear and convex functions on an Euclidean combinatorial set of polypermutations”, Comput. Math. Math. Phys., 34:6 (1994), 737–748
29.
Yu. G. Stoyan, O. O. ªmets, Teoriya i metodi evklidovo¿ kombinatorno¿ optimizatsi¿., ²SDO, Ki¿v, 1993. , 188 pp., (na ukrainskom) http://dspace.uccu.org.ua/handle/123456789/487
30.
O. A. Emets, Evklidovy kombinatornye mnozhestva i optimizatsiya na nikh. Novoe v matematicheskom programmirovanii, Ucheb. posobie, UMK VO, Kiev, 1992 , 92 pp. http://dspace.uccu.org.ua/handle/123456789/489
Contact us: