FRINK Linked Data Fragments server

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

• W4324286720 endingPage "32" @default.
• W4324286720 startingPage "15" @default.
• W4324286720 abstract "Introduction. The application of binary-reflected (mirror, reflexive) Gray codes for solving combinatorial problems with pseudo-Boolean functions (polynomials from Boolean variables) is considered. A recursive Ehrlich algorithm is given for generating a sequence of lines n-bit Gray codes, in which each subsequent line differs from the previous one by only one digit (bit). As an example of the effectiveness of the use of these codes, the solution of two combinatorial problems with Boolean variables with a complete enumeration of solutions is considered, and it is shown how these codes can be used to efficiently calculate the values of the objective function and constraints. The results of an experimental study are presented, which show that Gray codes can be practically applied in branching schemes, for example, in the branch and bound method, when the number of variables in the branching nodes of the decision algorithm does not exceed 35. Purpose. The purpose of the article is to show the developers of algorithms and programs how to apply Gray codes in various branching schemes of the decision algorithm, for example, in the branch and bound method, when the number of binary (Boolean) variables at the nodes of the tree is small (less than 35). The technique. The research methodology is based on a computational experiment for solving the 0-1 knapsack problem with the proposed algorithm of exhaustive search the solution with partial and full recalculation of the values of objective function and constraint of the problem. During the experiment, the accuracy of solving the problem by a “greedy” heuristic algorithm with time complexity O(n2) was also checked. Results. As a result of the experiment, it was found that the algorithm with a partial recalculation of the objective function and restrictions can be used for practical calculations in branching schemes, when the number of variables in the nodes of the branching tree does not exceed 35. The algorithm with partial recalculation is faster than the algorithm with full recalculation on average by 7 times. The heuristic greedy algorithm can be applied in practice to solve the 0-1 problem of a knapsack of large dimension (more than 10,000 items), when need to obtain an approximate value of the objective function at the limited computing resources. Scientific novelty and practical significance. The novelty of the work lies in the proposed approach to solving combinatorial optimization problems with pseudo-Boolean functions using Gray codes. The efficiency of the proposed algorithm with a partial recalculation of the values of the objective function and constraints is shown, and its can be applied in practice in various branching schemes of the decision algorithm. Keywords: Gray codes, combinatorial optimization problems, problem solving time." @default.
• W4324286720 created "2023-03-16" @default.
• W4324286720 creator A5000127249 @default.
• W4324286720 creator A5005966400 @default.
• W4324286720 creator A5036686881 @default.
• W4324286720 creator A5070532817 @default.
• W4324286720 creator A5078182466 @default.
• W4324286720 date "2022-12-29" @default.
• W4324286720 modified "2023-09-26" @default.
• W4324286720 title "On the Use of Gray Codes for Solving 0-1 Combinatorial Problems of Optimization in Environmental and Economic Systems" @default.
• W4324286720 cites W1970707250 @default.
• W4324286720 cites W1980985059 @default.
• W4324286720 cites W2006738678 @default.
• W4324286720 cites W2015457254 @default.
• W4324286720 cites W2044338030 @default.
• W4324286720 cites W2074078071 @default.
• W4324286720 cites W2080988231 @default.
• W4324286720 cites W2116220526 @default.
• W4324286720 cites W2131992008 @default.
• W4324286720 cites W2338188794 @default.
• W4324286720 cites W2966734597 @default.
• W4324286720 cites W4234689394 @default.
• W4324286720 cites W4236127247 @default.
• W4324286720 cites W966413371 @default.
• W4324286720 cites W2274235896 @default.
• W4324286720 doi "https://doi.org/10.34229/2707-451x.22.4.2" @default.
• W4324286720 hasPublicationYear "2022" @default.
• W4324286720 type Work @default.
• W4324286720 citedByCount "0" @default.
• W4324286720 crossrefType "journal-article" @default.
• W4324286720 hasAuthorship W4324286720A5000127249 @default.
• W4324286720 hasAuthorship W4324286720A5005966400 @default.
• W4324286720 hasAuthorship W4324286720A5036686881 @default.
• W4324286720 hasAuthorship W4324286720A5070532817 @default.
• W4324286720 hasAuthorship W4324286720A5078182466 @default.
• W4324286720 hasBestOaLocation W43242867201 @default.
• W4324286720 hasConcept C113138325 @default.
• W4324286720 hasConcept C11413529 @default.
• W4324286720 hasConcept C118615104 @default.
• W4324286720 hasConcept C126255220 @default.
• W4324286720 hasConcept C129861397 @default.
• W4324286720 hasConcept C156340839 @default.
• W4324286720 hasConcept C159985019 @default.
• W4324286720 hasConcept C187455244 @default.
• W4324286720 hasConcept C192562407 @default.
• W4324286720 hasConcept C206175624 @default.
• W4324286720 hasConcept C3309909 @default.
• W4324286720 hasConcept C33923547 @default.
• W4324286720 hasConcept C41008148 @default.
• W4324286720 hasConcept C48372109 @default.
• W4324286720 hasConcept C7342684 @default.
• W4324286720 hasConcept C94375191 @default.
• W4324286720 hasConceptScore W4324286720C113138325 @default.
• W4324286720 hasConceptScore W4324286720C11413529 @default.
• W4324286720 hasConceptScore W4324286720C118615104 @default.
• W4324286720 hasConceptScore W4324286720C126255220 @default.
• W4324286720 hasConceptScore W4324286720C129861397 @default.
• W4324286720 hasConceptScore W4324286720C156340839 @default.
• W4324286720 hasConceptScore W4324286720C159985019 @default.
• W4324286720 hasConceptScore W4324286720C187455244 @default.
• W4324286720 hasConceptScore W4324286720C192562407 @default.
• W4324286720 hasConceptScore W4324286720C206175624 @default.
• W4324286720 hasConceptScore W4324286720C3309909 @default.
• W4324286720 hasConceptScore W4324286720C33923547 @default.
• W4324286720 hasConceptScore W4324286720C41008148 @default.
• W4324286720 hasConceptScore W4324286720C48372109 @default.
• W4324286720 hasConceptScore W4324286720C7342684 @default.
• W4324286720 hasConceptScore W4324286720C94375191 @default.
• W4324286720 hasIssue "4" @default.
• W4324286720 hasLocation W43242867201 @default.
• W4324286720 hasOpenAccess W4324286720 @default.
• W4324286720 hasPrimaryLocation W43242867201 @default.
• W4324286720 hasRelatedWork W143146503 @default.
• W4324286720 hasRelatedWork W1536220277 @default.
• W4324286720 hasRelatedWork W1575676006 @default.
• W4324286720 hasRelatedWork W1582081218 @default.
• W4324286720 hasRelatedWork W1993456173 @default.
• W4324286720 hasRelatedWork W2037368754 @default.
• W4324286720 hasRelatedWork W2097859771 @default.
• W4324286720 hasRelatedWork W2162199822 @default.
• W4324286720 hasRelatedWork W4308758970 @default.
• W4324286720 hasRelatedWork W4324286720 @default.
• W4324286720 isParatext "false" @default.
• W4324286720 isRetracted "false" @default.
• W4324286720 workType "article" @default.