Publication:
Statistical Analysis of Binary Vector Enumeration Methods in Combinatorial Optimization

dc.contributor.authorKupriyashina, N. A.
dc.contributor.authorKupriyashin, M. A.
dc.contributor.authorSlonkina, I. S.
dc.contributor.authorBorzunov, G. I.
dc.contributor.authorКуприяшин, Михаил Андреевич
dc.contributor.authorБорзунов, Георгий Иванович
dc.date.accessioned2024-11-25T18:09:39Z
dc.date.available2024-11-25T18:09:39Z
dc.date.issued2020
dc.description.abstract© 2020 IEEE.In this paper, we review and analyze the efficiency of several binary vector enumeration algorithms we have been using in our work on the Knapsack Problem. As we keep in mind the possibility of massively parallel computation, we are interested in algorithms that are able to start the search from any vector (identified by ordinal number). In this case, it is possible to implement static load balancing efficiently. Apart from the actual implementation performance, we study the load balancing diagrams for each of the algorithms. We assume that every bit of the binary vector is associated with some fixed amount of work a computer must do and examine the resulting complexity of subtasks obtained by splitting the vector sequences into subsequences.
dc.format.extentС. 2084-2089
dc.identifier.citationStatistical Analysis of Binary Vector Enumeration Methods in Combinatorial Optimization / Kupriyashina, N.A. [et al.] // Proceedings of the 2020 IEEE Conference of Russian Young Researchers in Electrical and Electronic Engineering, EIConRus 2020. - 2020. - P. 2084-2089. - 10.1109/EIConRus49466.2020.9039096
dc.identifier.doi10.1109/EIConRus49466.2020.9039096
dc.identifier.urihttps://www.doi.org/10.1109/EIConRus49466.2020.9039096
dc.identifier.urihttps://www.scopus.com/record/display.uri?eid=2-s2.0-85082998632&origin=resultslist
dc.identifier.urihttps://openrepository.mephi.ru/handle/123456789/20594
dc.relation.ispartofProceedings of the 2020 IEEE Conference of Russian Young Researchers in Electrical and Electronic Engineering, EIConRus 2020
dc.titleStatistical Analysis of Binary Vector Enumeration Methods in Combinatorial Optimization
dc.typeConference Paper
dspace.entity.typePublication
relation.isAuthorOfPublicationd121410c-d598-45ff-aa9f-b1be65adf4c5
relation.isAuthorOfPublication8c9c0f28-77ec-4d14-9c70-e751d6c044c6
relation.isAuthorOfPublication.latestForDiscoveryd121410c-d598-45ff-aa9f-b1be65adf4c5
relation.isOrgUnitOfPublication010157d0-1f75-46b2-ab5b-712e3424b4f5
relation.isOrgUnitOfPublication.latestForDiscovery010157d0-1f75-46b2-ab5b-712e3424b4f5
Файлы
Коллекции