Application of the Global Equilibrium Search Method for Solving Boolean Programming Problems
Introduction. The significance of methods and algorithms for solving discrete optimization problems in mathematical supporting computer technologies of diverse levels and objectives is increasing. Consequently, the efficacy of discrete optimization methods deserves particular attention, as it drives...
Gespeichert in:
| Veröffentlicht in: | Kìbernetika ta komp'ûternì tehnologìï (Online) H. 2; S. 11 - 22 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
V.M. Glushkov Institute of Cybernetics
28.07.2023
|
| Schlagworte: | |
| ISSN: | 2707-4501, 2707-451X |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | Introduction. The significance of methods and algorithms for solving discrete optimization problems in mathematical supporting computer technologies of diverse levels and objectives is increasing. Consequently, the efficacy of discrete optimization methods deserves particular attention, as it drives the advancement of techniques capable of solving complex real-world problems. This paper introduces the Global Equilibrium Search (GES) method as a highly effective approach for solving Boolean programming problems, thus contributing to the field's progress and applicability.
Purpose. We describe the successful application of the approximate probabilistic GES method for effectively solving various Boolean programming problems.
Results. This paper explores the application of sequential GES algorithms for solving Boolean linear, Boolean quadratic programming, and other related problems with their specific characteristics. In our study, we conducted a comparative analysis to assess the effectiveness of GES algorithms by evaluating them against state-of-the-art approaches. Additionally, to parallelize the optimization process for discrete programming problems, we introduced algorithm unions, specifically portfolios, and teams. The efficiency of GES algorithm portfolios and teams is investigated by solving the maximum weighted graph cut problem, with subsequent comparisons to identify distinctions between them.
Conclusions. Based on the accumulated experience of applying GES algorithms and their modifications to solve discrete optimization problems, this study establishes the GES method as the leading approximate approach for Boolean programming. The results demonstrate the GES algorithm unions experience a significant boost in the optimization process speed, whereas algorithm teams demonstrate higher efficiency. Keywords: global equilibrium search method, Boolean programming problems, experimental studies, algorithm efficiency, algorithm unions (portfolios and teams). |
|---|---|
| AbstractList | Introduction. The significance of methods and algorithms for solving discrete optimization problems in mathematical supporting computer technologies of diverse levels and objectives is increasing. Consequently, the efficacy of discrete optimization methods deserves particular attention, as it drives the advancement of techniques capable of solving complex real-world problems. This paper introduces the Global Equilibrium Search (GES) method as a highly effective approach for solving Boolean programming problems, thus contributing to the field's progress and applicability.
Purpose. We describe the successful application of the approximate probabilistic GES method for effectively solving various Boolean programming problems.
Results. This paper explores the application of sequential GES algorithms for solving Boolean linear, Boolean quadratic programming, and other related problems with their specific characteristics. In our study, we conducted a comparative analysis to assess the effectiveness of GES algorithms by evaluating them against state-of-the-art approaches. Additionally, to parallelize the optimization process for discrete programming problems, we introduced algorithm unions, specifically portfolios, and teams. The efficiency of GES algorithm portfolios and teams is investigated by solving the maximum weighted graph cut problem, with subsequent comparisons to identify distinctions between them.
Conclusions. Based on the accumulated experience of applying GES algorithms and their modifications to solve discrete optimization problems, this study establishes the GES method as the leading approximate approach for Boolean programming. The results demonstrate the GES algorithm unions experience a significant boost in the optimization process speed, whereas algorithm teams demonstrate higher efficiency. Keywords: global equilibrium search method, Boolean programming problems, experimental studies, algorithm efficiency, algorithm unions (portfolios and teams). Introduction. The significance of methods and algorithms for solving discrete optimization problems in mathematical supporting computer technologies of diverse levels and objectives is increasing. Consequently, the efficacy of discrete optimization methods deserves particular attention, as it drives the advancement of techniques capable of solving complex real-world problems. This paper introduces the Global Equilibrium Search (GES) method as a highly effective approach for solving Boolean programming problems, thus contributing to the field's progress and applicability. Purpose. We describe the successful application of the approximate probabilistic GES method for effectively solving various Boolean programming problems. Results. This paper explores the application of sequential GES algorithms for solving Boolean linear, Boolean quadratic programming, and other related problems with their specific characteristics. In our study, we conducted a comparative analysis to assess the effectiveness of GES algorithms by evaluating them against state-of-the-art approaches. Additionally, to parallelize the optimization process for discrete programming problems, we introduced algorithm unions, specifically portfolios, and teams. The efficiency of GES algorithm portfolios and teams is investigated by solving the maximum weighted graph cut problem, with subsequent comparisons to identify distinctions between them. Conclusions. Based on the accumulated experience of applying GES algorithms and their modifications to solve discrete optimization problems, this study establishes the GES method as the leading approximate approach for Boolean programming. The results demonstrate the GES algorithm unions experience a significant boost in the optimization process speed, whereas algorithm teams demonstrate higher efficiency. |
| Author | Shylo, Vladimir Sergienko, Ivan Shylo, Petro Roshchyn, Valentyna |
| Author_xml | – sequence: 1 givenname: Ivan orcidid: 0000-0002-1118-7451 surname: Sergienko fullname: Sergienko, Ivan organization: V.M. Glushkov Institute of Cybernetics of the NAS of Ukraine, Kyiv – sequence: 2 givenname: Vladimir surname: Shylo fullname: Shylo, Vladimir organization: V.M. Glushkov Institute of Cybernetics of the NAS of Ukraine, Kyiv – sequence: 3 givenname: Valentyna surname: Roshchyn fullname: Roshchyn, Valentyna organization: V.M. Glushkov Institute of Cybernetics of the NAS of Ukraine, Kyiv – sequence: 4 givenname: Petro surname: Shylo fullname: Shylo, Petro organization: V.M. Glushkov Institute of Cybernetics of the NAS of Ukraine, Kyiv |
| BookMark | eNo9kM1KAzEURoNUsNY-gLu8wIz5mWRmlrXUWqgoVMGFEO5MkjYlM6mZqeDb2x_p5t6PsziLc4sGbWgNQveUpDxjrHxgOcmTTNDPlPGUpewKDS9ocNmE3qBx120JIaykhBdiiL4mu513NfQutDhY3G8MnvtQgcez773zropu3-CVgVhv8IvpN0FjGyJeBf_j2jV-DMEbaPFbDOsITXNkh11503R36NqC78z4_4_Qx9PsffqcLF_ni-lkmdRUUJZoXRaZlJxnUOQ8o4ZXnBlrayO4JLrWmknDhDS5zUta6ioXACUQyaWRwCwfocXZqwNs1S66BuKvCuDUCYS4VhB7V3ujai4ESJ6RDCCrqACrOS8Ik4wSo6U4uOjZVcfQddHYi48SdaqtjjnVMa1iXLHD-QNhnHPj |
| Cites_doi | 10.1016/j.ejor.2010.06.039 10.1007/s10559-010-9256-4 10.1287/opre.36.3.493 10.1137/S1052623497328987 10.1080/00207729408928968 10.1126/science.220.4598.671 10.1007/BF02667916 10.1007/s10559-012-9435-6 10.15388/Informatica.2006.138 10.1007/s10559-015-9692-2 10.1109/TCAD.1987.1270247 10.1137/S1052623400382467 10.1007/978-3-319-68640-0_23 10.1016/j.engappai.2012.09.001 10.1090/dimacs/020/04 10.4018/jsir.2011040103 10.1016/j.orl.2007.11.007 10.1007/978-1-4615-6089-0 10.1007/BFb0120892 10.1007/s10559-011-9368-5 10.1007/BF01098364 |
| ContentType | Journal Article |
| DBID | AAYXX CITATION DOA |
| DOI | 10.34229/2707-451X.23.2.2 |
| DatabaseName | CrossRef DOAJ Directory of Open Access Journals |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | CrossRef |
| Database_xml | – sequence: 1 dbid: DOA name: DOAJ Directory of Open Access Journals url: https://www.doaj.org/ sourceTypes: Open Website |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Sciences (General) |
| EISSN | 2707-451X |
| EndPage | 22 |
| ExternalDocumentID | oai_doaj_org_article_c355a63404aa4b15afd338026210ed65 10_34229_2707_451X_23_2_2 |
| GroupedDBID | AAYXX ALMA_UNASSIGNED_HOLDINGS CITATION GROUPED_DOAJ |
| ID | FETCH-LOGICAL-c1512-dd98466334a87341e3b32effce5360dcdd26e256e7f7919db75aa9a0636e6a2f3 |
| IEDL.DBID | DOA |
| ISSN | 2707-4501 |
| IngestDate | Fri Oct 03 12:31:27 EDT 2025 Sat Nov 29 04:41:23 EST 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 2 |
| Language | English |
| License | https://creativecommons.org/licenses/by-nc-sa/4.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c1512-dd98466334a87341e3b32effce5360dcdd26e256e7f7919db75aa9a0636e6a2f3 |
| ORCID | 0000-0002-1118-7451 |
| OpenAccessLink | https://doaj.org/article/c355a63404aa4b15afd338026210ed65 |
| PageCount | 12 |
| ParticipantIDs | doaj_primary_oai_doaj_org_article_c355a63404aa4b15afd338026210ed65 crossref_primary_10_34229_2707_451X_23_2_2 |
| PublicationCentury | 2000 |
| PublicationDate | 2023-7-28 |
| PublicationDateYYYYMMDD | 2023-07-28 |
| PublicationDate_xml | – month: 07 year: 2023 text: 2023-7-28 day: 28 |
| PublicationDecade | 2020 |
| PublicationTitle | Kìbernetika ta komp'ûternì tehnologìï (Online) |
| PublicationYear | 2023 |
| Publisher | V.M. Glushkov Institute of Cybernetics |
| Publisher_xml | – name: V.M. Glushkov Institute of Cybernetics |
| References | ref13 ref12 ref15 ref14 ref11 ref10 ref0 ref2 ref1 ref17 ref16 ref19 ref18 ref24 ref23 ref26 ref25 ref20 ref22 ref21 ref28 ref27 ref29 ref8 ref7 ref9 ref4 ref3 ref6 ref5 |
| References_xml | – ident: ref14 doi: 10.1016/j.ejor.2010.06.039 – ident: ref1 – ident: ref3 – ident: ref19 doi: 10.1007/s10559-010-9256-4 – ident: ref5 – ident: ref15 doi: 10.1287/opre.36.3.493 – ident: ref23 doi: 10.1137/S1052623497328987 – ident: ref10 doi: 10.1080/00207729408928968 – ident: ref2 doi: 10.1126/science.220.4598.671 – ident: ref0 doi: 10.1007/BF02667916 – ident: ref22 – ident: ref25 – ident: ref20 doi: 10.1007/s10559-012-9435-6 – ident: ref13 doi: 10.15388/Informatica.2006.138 – ident: ref27 doi: 10.1007/s10559-015-9692-2 – ident: ref16 doi: 10.1109/TCAD.1987.1270247 – ident: ref4 – ident: ref24 doi: 10.1137/S1052623400382467 – ident: ref6 – ident: ref28 doi: 10.1007/978-3-319-68640-0_23 – ident: ref29 doi: 10.1016/j.engappai.2012.09.001 – ident: ref17 doi: 10.1090/dimacs/020/04 – ident: ref21 doi: 10.4018/jsir.2011040103 – ident: ref18 doi: 10.1016/j.orl.2007.11.007 – ident: ref26 – ident: ref8 – ident: ref7 doi: 10.1007/978-1-4615-6089-0 – ident: ref11 doi: 10.1007/BFb0120892 – ident: ref9 doi: 10.1007/s10559-011-9368-5 – ident: ref12 doi: 10.1007/BF01098364 |
| SSID | ssj0002910385 ssib044750725 |
| Score | 2.2267678 |
| Snippet | Introduction. The significance of methods and algorithms for solving discrete optimization problems in mathematical supporting computer technologies of diverse... |
| SourceID | doaj crossref |
| SourceType | Open Website Index Database |
| StartPage | 11 |
| SubjectTerms | algorithm efficiency algorithm unions (portfolios and teams) boolean programming problems experimental studies global equilibrium search method |
| Title | Application of the Global Equilibrium Search Method for Solving Boolean Programming Problems |
| URI | https://doaj.org/article/c355a63404aa4b15afd338026210ed65 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAON databaseName: DOAJ Directory of Open Access Journals customDbUrl: eissn: 2707-451X dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0002910385 issn: 2707-4501 databaseCode: DOA dateStart: 20200101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 2707-451X dateEnd: 99991231 omitProxy: false ssIdentifier: ssib044750725 issn: 2707-4501 databaseCode: M~E dateStart: 20200101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1NS8QwEA0iHryIn_hNDh5U6NpO0mRzXEXx4rKgwh6EMG0mIOhWXdffb9JUXU9evA6lhJlJ5k0yvMfYkSfsoxaQFQZdJuOWqlSNWY5FTmCAELEVm9DDYX88NqM5qa84E5bogZPjzupQEFEJmUtEWRUlehe6qtA5hF6FnGrZSwPqmWumQiZFFrtcd5kaz2QwkQg8zjOCziPRd16kJ04hAcxZZyzGPRA96MGvIjXH5d8WnatVttKhRT5Iq1xjCzRZZ2vdfpzy4440-mSDPQx-XqJ543nAdTzx-fPL19ljO9k_e-ZpupjftLrRPABWfts8xTsFft40T4QTPkoDW8_RNkpqM9NNdn91eXdxnXXKCVkdK3jmnAm4Qgkhsa9DnSJRCSDvayqFyl3tHCgKYIe016YwrtIlosEAVxQpBC-22OKkmdA244i1JOWlC9AjHKpYuaoiwEr7shRIcoedfrnKviSCDBsai9avNvrVRr9aEBYs7LDz6MzvDyO3dWsIEbddxO1fEd_9j5_sseUoHB9vaaG_zxbf32Z0wJbqj_fH6dthm0yfe_fJig |
| linkProvider | Directory of Open Access Journals |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Application+of+the+Global+Equilibrium+Search+Method+for+Solving+Boolean+Programming+Problems&rft.jtitle=K%C3%ACbernetika+ta+komp%27%C3%BBtern%C3%AC+tehnolog%C3%AC%C3%AF+%28Online%29&rft.au=Sergienko%2C+Ivan&rft.au=Shylo%2C+Vladimir&rft.au=Roshchyn%2C+Valentyna&rft.au=Shylo%2C+Petro&rft.date=2023-07-28&rft.issn=2707-4501&rft.eissn=2707-451X&rft.issue=2&rft.spage=11&rft.epage=22&rft_id=info:doi/10.34229%2F2707-451X.23.2.2&rft.externalDBID=n%2Fa&rft.externalDocID=10_34229_2707_451X_23_2_2 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2707-4501&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2707-4501&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2707-4501&client=summon |