, 0000.CrossRef  G. Dahl and B. Johannessen. The 0-path network design problem. Networks, 00:000-000, 0000.MathSciNetCrossRefMATH  G. Dahl, A. Martin, and M. Stoer. Routing through virtual paths in layered telecommunication networks. Operations Research, 00:000-000, 0000.MathSciNetCrossRefMATH  A. Duarte, F. Fernández, Á. Sánchez, and A. Sanz. A hierarchical social metaheuristic for the Max-Cut problem. In J. Gottlieb and G.R. Raidl, editors, Evolutionary computation in combinatorial optimization, volume 0000 of Lecture Notes in Computer Science, pages 00-00. Springer, Berlin, 0000.  S. Even, A. Itai, and A. Shamir. On the complexity of timetable and multicommodity flow problems. SIAM Journal on Computing, 0:000-000, 0000.MathSciNetCrossRefMATH  P. Festa, P.M. Pardalos, M.G.C. Resende, and C.C. Ribeiro. Randomized heuristics for the MAX-CUT problem. Optimization Methods and Software, 0:0000-0000, 0000.MathSciNetCrossRefMATH  B. Fortz and M. Thorup. Increasing Internet capacity using local search. Computational Optimization and Applications, 00:00