The State Minimization Problem for Nondeterministic Finite Automata: The Parallel Implementation of the Truncated Branch and Bound Method

2012 ◽  
Author(s):  
Boris Melnikov ◽  
Andrey Tsyganov
Keyword(s):  
Branch And Bound ◽  
Minimization Problem ◽  
Parallel Implementation ◽  
Finite Automata ◽  
The State ◽  
Branch And Bound Method ◽  
Nondeterministic Finite Automata ◽  
State Minimization

scholarly journals PARALLEL IMPLEMENTATION OF THE COMBINED ALGORITHM OF THE BRANCH AND BOUND METHOD

2020 ◽  
pp. 437-439
Author(s):  
Valeriy Ivaschenko ◽  
Gennady Shvachych ◽  
Vladimir Konovalenkov ◽  
Vladimir Khristyan
Keyword(s):  
Distributed Computing ◽  
Branch And Bound ◽  
Knapsack Problem ◽  
Heuristic Search ◽  
Parallel Implementation ◽  
Branch And Bound Algorithm ◽  
Specific Class ◽  
Branch And Bound Method ◽  
Common Solution ◽  
Combined Algorithm

Parallel implementation of a combined branch-and-bound algorithm for the knapsack problem are considered. An approach combining parallel implementations of the branch-and-bound method and the heuristic search is proposed and implemented. Basic attention is focused on the questions of research of efficiency and acceleration for calculations due to the increase of the cluster system knots. As a result of the proposed approach, a organization scheme of the combined algorithm of distributed computing was obtained. The approach proposed in this paper saves the developers’ efforts by reapplying common parts of the algorithm to solve various problems of optimization. In fact, one can implement a common solution scheme for different platforms once, and later use only problem-dependent modules for a specific class of problems.

Sign in / Sign up

Export Citation Format

Share Document