A study of the parameters of branch-and-bound algorithms for solving the symmetric traveling salesman problem

zbMath0921.90142MaRDI QIDQ1281074

I. L. Melamed, I. Kh. Sigal

Publication date: 29 June 1999

Published in: Automation and Remote Control (Search for Journal in Brave)

zbMATH Keywords

branch-and-boundsymmetric traveling salesmanascent algorithms

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

This page was built for publication: A study of the parameters of branch-and-bound algorithms for solving the symmetric traveling salesman problem