FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W4319231036> ?p ?o ?g. }

• W4319231036 endingPage "69" @default.
• W4319231036 startingPage "60" @default.
• W4319231036 abstract "Objectives . Network diagrams are used as an information support element in planning and project management processes for structuring planned work and calculating project efficiency characteristics. In order to optimize and balance resources used in projects, it becomes necessary to locate in these models not only the critical path of the maximum weighted length, but also the subcritical paths closest to it having a shorter length in relation to it. The aim of the work is to synthesize and analyze an algorithm for finding k -shortest paths between the input and output network vertices, on which basis the above-mentioned subcritical paths can be identified. Methods . The provisions of graph theory and group theory, as well as the method of dynamic programming, were used. Results . An algorithm for finding k- shortest paths in contourless directed graphs having a strict order relation was developed. Abstract elements were defined according to group theory in graphs as p- contours, between which a multilevel structure of relations for implementing the necessary search of paths was then established. For substantiating the efficiency of the constructed algorithm, the validity of the main provisions was demonstrated as follows: firstly, the multilevel system of relations is exhaustive; secondly, there is no loss in the final solution during the operation of the algorithm; thirdly, the paths obtained as a result of the work of the algorithm satisfy the main required relation between them. Numerically, the algorithm was implemented by the dynamic programming method extended by means of an additional functional relationship, implying the presence of suboptimal policies. Conclusions . The conducted runs of computational experiments confirmed the operability and efficiency of the software-implemented algorithm. The performed analysis demonstrated the good convergence characteristics of the proposed algorithm as compared with other algorithms of this class applied to network diagrams. On this basis, it can be recommended for practical use in project management information systems." @default.
• W4319231036 created "2023-02-05" @default.
• W4319231036 creator A5040614355 @default.
• W4319231036 date "2023-02-03" @default.
• W4319231036 modified "2023-09-25" @default.
• W4319231036 title "Algorithm for finding subcritical paths on network diagrams" @default.
• W4319231036 cites W1973804680 @default.
• W4319231036 cites W1977445660 @default.
• W4319231036 cites W1993873173 @default.
• W4319231036 cites W1999988175 @default.
• W4319231036 cites W2010945917 @default.
• W4319231036 cites W2011282943 @default.
• W4319231036 cites W2022573578 @default.
• W4319231036 cites W2023132252 @default.
• W4319231036 cites W2033102973 @default.
• W4319231036 cites W2043779727 @default.
• W4319231036 cites W2048699920 @default.
• W4319231036 cites W2048737342 @default.
• W4319231036 cites W2048848130 @default.
• W4319231036 cites W2058489727 @default.
• W4319231036 cites W2083214910 @default.
• W4319231036 cites W2089957823 @default.
• W4319231036 cites W2102077730 @default.
• W4319231036 cites W2131058166 @default.
• W4319231036 cites W2140442875 @default.
• W4319231036 cites W2144050074 @default.
• W4319231036 cites W2168949701 @default.
• W4319231036 cites W2227557434 @default.
• W4319231036 cites W2560363104 @default.
• W4319231036 cites W2912657179 @default.
• W4319231036 cites W2976388213 @default.
• W4319231036 cites W3033680092 @default.
• W4319231036 cites W3094709987 @default.
• W4319231036 cites W3165571261 @default.
• W4319231036 cites W3212530569 @default.
• W4319231036 cites W330173345 @default.
• W4319231036 cites W4237961505 @default.
• W4319231036 cites W4376522482 @default.
• W4319231036 cites W2277605219 @default.
• W4319231036 doi "https://doi.org/10.32362/2500-316x-2023-11-1-60-69" @default.
• W4319231036 hasPublicationYear "2023" @default.
• W4319231036 type Work @default.
• W4319231036 citedByCount "0" @default.
• W4319231036 crossrefType "journal-article" @default.
• W4319231036 hasAuthorship W4319231036A5040614355 @default.
• W4319231036 hasConcept C10138342 @default.
• W4319231036 hasConcept C11413529 @default.
• W4319231036 hasConcept C114614502 @default.
• W4319231036 hasConcept C115874739 @default.
• W4319231036 hasConcept C124101348 @default.
• W4319231036 hasConcept C12426560 @default.
• W4319231036 hasConcept C126255220 @default.
• W4319231036 hasConcept C127413603 @default.
• W4319231036 hasConcept C132525143 @default.
• W4319231036 hasConcept C162324750 @default.
• W4319231036 hasConcept C173870130 @default.
• W4319231036 hasConcept C199360897 @default.
• W4319231036 hasConcept C201995342 @default.
• W4319231036 hasConcept C22590252 @default.
• W4319231036 hasConcept C2524010 @default.
• W4319231036 hasConcept C25343380 @default.
• W4319231036 hasConcept C2775945657 @default.
• W4319231036 hasConcept C2777735758 @default.
• W4319231036 hasConcept C33923547 @default.
• W4319231036 hasConcept C37404715 @default.
• W4319231036 hasConcept C41008148 @default.
• W4319231036 hasConcept C80444323 @default.
• W4319231036 hasConcept C88230418 @default.
• W4319231036 hasConceptScore W4319231036C10138342 @default.
• W4319231036 hasConceptScore W4319231036C11413529 @default.
• W4319231036 hasConceptScore W4319231036C114614502 @default.
• W4319231036 hasConceptScore W4319231036C115874739 @default.
• W4319231036 hasConceptScore W4319231036C124101348 @default.
• W4319231036 hasConceptScore W4319231036C12426560 @default.
• W4319231036 hasConceptScore W4319231036C126255220 @default.
• W4319231036 hasConceptScore W4319231036C127413603 @default.
• W4319231036 hasConceptScore W4319231036C132525143 @default.
• W4319231036 hasConceptScore W4319231036C162324750 @default.
• W4319231036 hasConceptScore W4319231036C173870130 @default.
• W4319231036 hasConceptScore W4319231036C199360897 @default.
• W4319231036 hasConceptScore W4319231036C201995342 @default.
• W4319231036 hasConceptScore W4319231036C22590252 @default.
• W4319231036 hasConceptScore W4319231036C2524010 @default.
• W4319231036 hasConceptScore W4319231036C25343380 @default.
• W4319231036 hasConceptScore W4319231036C2775945657 @default.
• W4319231036 hasConceptScore W4319231036C2777735758 @default.
• W4319231036 hasConceptScore W4319231036C33923547 @default.
• W4319231036 hasConceptScore W4319231036C37404715 @default.
• W4319231036 hasConceptScore W4319231036C41008148 @default.
• W4319231036 hasConceptScore W4319231036C80444323 @default.
• W4319231036 hasConceptScore W4319231036C88230418 @default.
• W4319231036 hasIssue "1" @default.
• W4319231036 hasLocation W43192310361 @default.
• W4319231036 hasOpenAccess W4319231036 @default.
• W4319231036 hasPrimaryLocation W43192310361 @default.
• W4319231036 hasRelatedWork W2107473678 @default.
• W4319231036 hasRelatedWork W2359847778 @default.
• W4319231036 hasRelatedWork W2375280931 @default.

• next