Andrey Vladimirovich Tsyganov

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
In the present paper we discuss a multi-heuristic optimization technique for hard combinatorial optimization problems and outline its algorithmic skeleton. The proposed technique is based on a combination of heuristics commonly used in the area of combinatorial optimization and two branch-and-bound methods. Preliminary results show that this approach can be(More)
In this paper we present an approach to the parallel implementation of the state minimization problem for nondeterministic finite automata. This approach is based on the truncated branch and bound method and also on the usage of basis and <i>COM</i> automata for the given language. Minimum state automata are searched as sub-automata of the <i>COM</i>(More)
  • 1