Computing algorithms for solution of some linear and linear integer programming problems. III

General structures used in implementation of an elementary operation are de­ tailed for the traveling salesman problem. A method is proposed for improving the lower bound of the initial 1-functional obtained from that implementation.