What is it about?

The method of interchanging networks resulting from structural investigations is described to solve such problems, where the solution set is given by the set of all permutations of m elements. Some applications of this method are discussed. With regard to the application for solving the traveling salesman problem a coupling of the method of interchanging networks with the extension principle algorithm is described and computational results are presented.

Featured Image

Read the Original

This page is a summary of: On the method of interchanging networks for permutation problems, Optimization, January 1986, Taylor & Francis,
DOI: 10.1080/02331938608843179.
You can read the full text:

Read

Contributors

The following have contributed to this page