Abstract:
The problem discussed is minimization of the time for check of a system of $n$ blocks. The operability of each of these is tested by a checking unit through test of $m$ various parameters. Parameters of the same type cannot be tested simultaneously for different blocks. The problem reduces to a salesman problem solved by the branch-and-bound method.