, 0000.  E.D. Taillard. Robust taboo search for the quadratic assignment problem. Parallel Computing , 00:000-000, 0000. MathSciNet  H. Takahashi and A. Matsuyama. An approximate solution for the Steiner problem in graphs. Mathematica Japonica