Articles - Sciact

Articles (88)

#	Публикация
41	Kononov A.V. , Panin A.A. , Plyasunov A.V. A New Model of Competitive Location and Pricing with the Uniform Split of the Demand Communications in Computer and Information Science. 2018. V.871. P.16-28. DOI: 10.1007/978-3-319-93800-4_2 Scopus OpenAlex
42	Gu H. , Kononov A.V. , Memar J. , Zinder Y. Efficient Lagrangian Heuristics for the Two-Stage Flow Shop with Job Dependent Buffer Requirements Journal of Discrete Algorithms. 2018. N52-53. P.143-155. DOI: 10.1016/j.jda.2018.11.011.
43	Arantes L. , Bampis E. , Kononov A. , Letsios M. , Lucarelli G. , Sens P. Scheduling under Uncertainty: A Query-based Approach In compilation Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, Stockholm, 13-19 July 2018. – International Joint Conferences on Artificial Intelligence., 2018. – C.4646-4652. – ISBN 978-0-9992411-2-7. DOI: 10.24963/ijcai.2018/646 Scopus OpenAlex
44	Memar J. , Zinder Y. , Kononov A.V. Worst-Case Analysis of a Modification of the Brucker-Garey-Johnson Algorithm In compilation Optimization Problems and Their Applications. OPTA 2018. Communications in Computer and Information Science. – Springer International Publishing AG., 2018. – Т.871. – C.78-92. – ISBN 9783319937991. DOI: 10.1007/978-3-319-93800-4_7 Scopus OpenAlex
45	Kononov A. , Kovalenko Y. An Approximation Algorithm for Preemptive Speed Scaling Scheduling of Parallel Jobs with Migration In compilation Lecture Notes in Computer Science. – Springer International Publishing AG 2017., 2017. – Т.10556. – C.351-357. – ISBN 9783319694030. DOI: 10.1007/978-3-319-69404-7_30 OpenAlex
46	Кононов А. , Кононова П. О МИНИМИЗАЦИИ ВРЕМЕНИ ПЕРЕДАЧИ ПАКЕТОВ В АЦИКЛИЧЕСКОЙ СЕТИ С ЧЕТЫРЬМЯ СЕРВЕРАМИ Дискретный анализ и исследование операций. 2016. Т.23. №4. С.5 - 25. DOI: 10.17377/daio.2016.23.525
47	Kononov A.V. , Kononova P.A. On minimizing dataset transfer time in an acyclic network with four servers Journal of Applied and Industrial Mathematics. 2016. V.10. N4. P.494-504. DOI: 10.1134/s1990478916040050 Scopus OpenAlex
48	Angel E. , Bampis E. , Kononov A. , Paparas D. , Pountourakis E. , Zissimopoulos V. Clustering on k-Edge-Colored graphs Discrete Applied Mathematics. 2016. V.211. P.15-22. DOI: 10.1016/j.dam.2016.04.017 WOS Scopus OpenAlex
49	Kononov A. , Kovalenko Y. On Speed Scaling Scheduling of Parallel Jobs with Preemption In compilation Lecture Notes in Computer Science Discrete Optimization and Operations Research 9th International Conference, DOOR 2016, Vladivostok, Russia, September 19-23, 2016, Proceedings. – Springer International Publishing., 2016. – Т.9869. – C.309-321. – ISBN 9783319449135. DOI: 10.1007/978-3-319-44914-2_25 Scopus РИНЦ OpenAlex
50	Lin B.M.T. , Hwang F.J. , Kononov A.V. Relocation scheduling subject to fixed processing sequences Journal of Scheduling. 2015. V.19. N2. P.153-163. DOI: 10.1007/s10951-015-0455-8 WOS Scopus OpenAlex
51	Dugarzhapov A. , Kononov A. A polynomial-time algorithm for the preemptive mixed-shop problem with two unit operations per job Journal of Scheduling. 2015. V.19. N1. P.61-72. DOI: 10.1007/s10951-015-0454-9 WOS Scopus OpenAlex
52	Kononov A.V. , Lin B.M.T. , Fang K-T. Single-machine scheduling with supporting tasks Discrete Optimization. 2015. V.17. P.69-79. DOI: 10.1016/j.disopt.2015.05.001 WOS Scopus OpenAlex
53	Kononov A. O(log m)-approximation for the routing open shop problem RAIRO - Operations Research. 2015. V.49. N2. 9 :1-9. DOI: 10.1051/ro/2014051 WOS Scopus OpenAlex
54	Ageev A. , Kononov A. Improved Approximations for the Max k-Colored Clustering Problem Lecture Notes in Computer Science. 2015. P.1-10. DOI: 10.1007/978-3-319-18263-6_1 WOS Scopus OpenAlex
55	Angel E. , Bampis E. , Chau V. , Kononov A. Min-Power Covering Problems In compilation Elbassioni, K., Makino, K. (eds) Algorithms and Computation. ISAAC 2015. Lecture Notes in Computer Science.. – Springer., 2015. – Т.9472. – C.367-377. DOI: 10.1007/978-3-662-48971-0_32 Scopus РИНЦ OpenAlex
56	Bampis E. , Kononov A. , Letsios D. , Lucarelli G. , Nemparis I. From preemptive to non-preemptive speed-scaling scheduling Discrete Applied Mathematics. 2014. V.181. P.11-20. DOI: 10.1016/j.dam.2014.10.007 WOS Scopus OpenAlex
57	Bampis E. , Kononov A. , Lucarelli G. , Milis I. Bounded max-colorings of graphs Journal of Discrete Algorithms. 2014. V.26. P.56-68. DOI: 10.1016/j.jda.2013.11.003 Scopus OpenAlex
58	Angel E. , Bampis E. , Kononov A. , Paparas D. , Pountourakis E. , Zissimopoulos V. Clustering on k-Edge-Colored Graphs In compilation Mathematical Foundations of Computer Science 2013. MFCS 2013. Lecture Notes in Computer Science. – Springer-Verlag,., 2013. – Т.8087. – C.50-61. – ISBN 9783642403125. DOI: 10.1007/978-3-642-40313-2_7 OpenAlex
59	Chernykh I. , Kononov A. , Sevastyanov S. Efficient approximation algorithms for the routing open shop problem Computers and Operations Research. 2012. V.40. N3. P.841-847. DOI: 10.1016/j.cor.2012.01.006 WOS Scopus OpenAlex
60	Gawiejnowicz S. , Kononov A. Isomorphic scheduling problems Annals of Operations Research. 2012. V.213. N1. P.131-145. DOI: 10.1007/s10479-012-1222-2 WOS Scopus OpenAlex

3 / 5 - Total 88 records

Filter

field.name

Year

DOI

Abstract

Order

Columns

Per page

Reset