To whom it may Concern.
I am involved in a personal project using the Steiner problem and found until now two complete solutions:
A. Using the Heuristic algorithm of H. Takahashi and A. Matsuyama, an excellent internet article but only by reference because the source C code is in at Library of Imperial College of London I can not register in any form in that library, the complexity of my problem is a "b" level.
B. In this Web Site using the Annealing algorithm is an excellent solution too, but the zip file do not exist and I can not downloaded it with the complete solution.
Please may anyone help me to find any completed solution for initially, 75 nodes, 150 arcs and 13 terminals nodes (steinb10), preferentially programmed in Visual Studio C# 2013.
Best Regards
Thanks for your time.
Luis E. Guzman