The traveling salesman's problem. Exact methods

An algorithm is discussed for optimal solution of the traveling salesman's problem. Dynamic programming methods, versions of the branch-and-bound method, Lagrangeans multiplier methods, sectioning planes method, and various combinations of these methods are discussed. Data of numerical experiments is provided.