Abstract

A hierarchical configuration procedure in the process of analyzing the functioning of organizational structures using algorithms for solving problems using discrete programming methods is considered in detail in this paper. On the basis of the research, the authors propose a methodology for the combined application of an initial approximation algorithm with certain properties and an algorithm for a recursive procedure for a directed search for the optimal hierarchy, which, in the future, solving the traveling salesman problem in a minimum time much more efficient than using the methods of dynamic programming of branches and boundaries.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call