PERMANENT DECOMPOSITION ALGORITHM FOR THE COMBINATORIAL OBJECTS GENERATION

Context. The problem of generating vectors consisting of different representatives of a given set of sets is considered. Such problems arise, in particular, in scheduling theory, when scheduling appointments. A special case of this problem is the problem of generating permutations. Objective. Proble...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Radìoelektronika, informatika, upravlìnnâ H. 4; S. 119
Hauptverfasser: Turbal, Y. V., Babych, S. V., Kunanets, N. E.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: 11.12.2022
ISSN:1607-3274, 2313-688X
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract Context. The problem of generating vectors consisting of different representatives of a given set of sets is considered. Such problems arise, in particular, in scheduling theory, when scheduling appointments. A special case of this problem is the problem of generating permutations. Objective. Problem is considered from the point of view of a permanent approach and a well-known one, based on the concept of lexicographic order. Method. In many tasks, it becomes necessary to generate various combinatorial objects: permutations, combinations with and without repetitions, various subsets. In this paper we consider a new approach to the combinatorial objects generation, which is based on the procedure of the permanent decomposition. Permanent is built for the special matrix of incidence. The main idea of this approach is including to the process of the algebraic permanent decomposition by row additional function for the column identifiers writing into corresponding data structures. In this case, the algebraic permanent in not calculated, but we get a specific recursive algorithm for generating a combinatorial object. The computational complexity of this algorithm is analyzed. Results. It is investigated a new approach to the generation of complex combinatorial objects, based on the procedure of decomposition of the modified permanent of the incidence matrix by line with memorization of index elements. Conclusions. The permanent algorithms of the combinatorial objects generation is investigated. The complexity of our approach in the case of permutation is compared with the lexicographic algorithm and the Johnson-Trotter algorithm. The obtained results showed that our algorithm belongs to the same complexity class as the lexicographic algorithm and the Johnson-Trotter method. Numerical results confirmed the effectiveness of our approach.
AbstractList Context. The problem of generating vectors consisting of different representatives of a given set of sets is considered. Such problems arise, in particular, in scheduling theory, when scheduling appointments. A special case of this problem is the problem of generating permutations. Objective. Problem is considered from the point of view of a permanent approach and a well-known one, based on the concept of lexicographic order. Method. In many tasks, it becomes necessary to generate various combinatorial objects: permutations, combinations with and without repetitions, various subsets. In this paper we consider a new approach to the combinatorial objects generation, which is based on the procedure of the permanent decomposition. Permanent is built for the special matrix of incidence. The main idea of this approach is including to the process of the algebraic permanent decomposition by row additional function for the column identifiers writing into corresponding data structures. In this case, the algebraic permanent in not calculated, but we get a specific recursive algorithm for generating a combinatorial object. The computational complexity of this algorithm is analyzed. Results. It is investigated a new approach to the generation of complex combinatorial objects, based on the procedure of decomposition of the modified permanent of the incidence matrix by line with memorization of index elements. Conclusions. The permanent algorithms of the combinatorial objects generation is investigated. The complexity of our approach in the case of permutation is compared with the lexicographic algorithm and the Johnson-Trotter algorithm. The obtained results showed that our algorithm belongs to the same complexity class as the lexicographic algorithm and the Johnson-Trotter method. Numerical results confirmed the effectiveness of our approach.
Author Babych, S. V.
Kunanets, N. E.
Turbal, Y. V.
Author_xml – sequence: 1
  givenname: Y. V.
  surname: Turbal
  fullname: Turbal, Y. V.
– sequence: 2
  givenname: S. V.
  surname: Babych
  fullname: Babych, S. V.
– sequence: 3
  givenname: N. E.
  surname: Kunanets
  fullname: Kunanets, N. E.
BookMark eNo9UN1KwzAYDTLBOfcGXuQFovmSLGkvu5q1HV0zugjehTRrQdFNWm98-7UqXh04f3DOLZqdzqcWoXugD7BaRdEjSKoIZ0oQRhkjggC9QnPGgRMZRS8zNP933KDlMLxRSmEVSRBqjrZ7Xe-SSlcWP-nU7PbmUNjCVDgpM1MXNt_hjamxzTUe1XVRJXakkxKb9Van9oAzXek6mSJ36Lrz70O7_MMFet5om-akNFmRJiUJoOQXaVkXU2iU51zGEHVUykaAYq3iTdM1QUqggYUAXvpjQ9kxiJGIWfAd86OdL5D47Q39eRj6tnOf_euH778dUPdziZsGu2mwmy5xYlT4BSdcT1s
ContentType Journal Article
DBID AAYXX
CITATION
DOI 10.15588/1607-3274-2022-4-10
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList CrossRef
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 2313-688X
ExternalDocumentID 10_15588_1607_3274_2022_4_10
GroupedDBID AAYXX
ADBBV
ALMA_UNASSIGNED_HOLDINGS
BCNDV
CITATION
GROUPED_DOAJ
ID FETCH-LOGICAL-c176t-e2f901b7a336918f066b4172e73bbfbc6610c2cc1a6adb02dc410c92caf2a8f03
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000913220000010&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1607-3274
IngestDate Sat Nov 29 05:06:08 EST 2025
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 4
Language English
License https://creativecommons.org/licenses/by-sa/4.0
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c176t-e2f901b7a336918f066b4172e73bbfbc6610c2cc1a6adb02dc410c92caf2a8f03
OpenAccessLink http://ric.zntu.edu.ua/article/download/268849/264295
ParticipantIDs crossref_primary_10_15588_1607_3274_2022_4_10
PublicationCentury 2000
PublicationDate 2022-12-11
PublicationDateYYYYMMDD 2022-12-11
PublicationDate_xml – month: 12
  year: 2022
  text: 2022-12-11
  day: 11
PublicationDecade 2020
PublicationTitle Radìoelektronika, informatika, upravlìnnâ
PublicationYear 2022
SSID ssj0001586147
ssib018208917
ssib015895113
ssib044757822
Score 2.2030337
Snippet Context. The problem of generating vectors consisting of different representatives of a given set of sets is considered. Such problems arise, in particular, in...
SourceID crossref
SourceType Index Database
StartPage 119
Title PERMANENT DECOMPOSITION ALGORITHM FOR THE COMBINATORIAL OBJECTS GENERATION
WOSCitedRecordID wos000913220000010&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAON
  databaseName: Directory of Open Access Journals
  customDbUrl:
  eissn: 2313-688X
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0001586147
  issn: 1607-3274
  databaseCode: DOA
  dateStart: 19990101
  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: 2313-688X
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssib044757822
  issn: 1607-3274
  databaseCode: M~E
  dateStart: 19990101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lj9MwELaqhQMcEE8BCygHblFK7TiJc-yWwBZoWm0LWk6R7bUltKts1U2r5RfwtxnbeRUQYg9cknZqTaLMp8k37jwQek1TFbMRN-VnWAdUaB2wFJNAhyHhUmtMObXDJpI8Z6en6WIw-NHUwuwukrJk19fp-r-aGmRgbFM6ewNzt0pBAJ_B6HAEs8Pxnwy_yE5m4zzLV_7bbDKfLebLqZ2sM_70fn4yXR3PfAj8bKYP_Ho0zccrEJv0Hzv5ZOm7ZLZ256pp3g1QMP-pTy7hPXVuB-ecW95Zd16t6q_b9YbvLtxSoMbm3OUvbzduvoD_deh_GXabqOK7G0i17Is_bktequrK1YP52bC_QUHsrJTagTqfGputUOKG8QyVlQGrDIOY2anCDcRoz49i50d_8-9RxEzRQqsysBekQZ0au9dO-5fXXJt8aMIeo6cwWgqjpTBaClqYUr1bJIlS1ovNwTHhiAER7XiPaXrPenGuaZqYNH0QXXk6A9pjB_s0d1qXbZoLv_nD7fdoUY_frO6je3Vg4o0doB6ggSoforu9dpWP0IcWWt4etLwWWh5AywNoeXvQ8mpoeR20HqPP77LV5DioZ3EEEidxFSiigTmKhIdhnGKmgakKCuRXJaEQWkigeSNJpMQ85mdiRM4kBUFKJNeEw_LwCTooL0v1FHlYwBIgRTqJYiqIFrEKNRWRkiSWGPNnKGgeRbF2LVeKv9ns-Q3XH6I7HUxfoINqs1Uv0W25q75dbV5Zw_8EkuRejg
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=PERMANENT+DECOMPOSITION+ALGORITHM+FOR+THE+COMBINATORIAL+OBJECTS+GENERATION&rft.jtitle=Rad%C3%ACoelektronika%2C+informatika%2C+upravl%C3%ACnn%C3%A2&rft.au=Turbal%2C+Y.+V.&rft.au=Babych%2C+S.+V.&rft.au=Kunanets%2C+N.+E.&rft.date=2022-12-11&rft.issn=1607-3274&rft.eissn=2313-688X&rft.issue=4&rft.spage=119&rft_id=info:doi/10.15588%2F1607-3274-2022-4-10&rft.externalDBID=n%2Fa&rft.externalDocID=10_15588_1607_3274_2022_4_10
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1607-3274&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1607-3274&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1607-3274&client=summon