MATH  R.M. Karp. Reducibility among combinatorial problems. In R.E. Miller and J.W. Thatcher, editors, Complexity of computer computations. Plenum Press, New York, 0000.  G.A. Kochenberger, J.-K. Hao, Z. Lu, H. Wang, and F. Glover. Solving large scale Max Cut problems via tabu search. Journal of Heuristics, 00: 000-000, 0000.CrossRef  M. Laguna and F. Glover. Bandwidth packing: A tabu search approach. Management Science, 00:000-000, 0000.CrossRefMATH  L.J. LeBlanc, J. Chifflet, and P. Mahey. Packet routing in telecommunication networks with path and flow restrictions. INFORMS Journal on Computing, 00:000-000, 0000.MathSciNetCrossRefMATH  P.C. Liu and R.C. Geldmacher. On the deletion of nonplanar edges of a graph. In Proceedings of the 00th Southeastern Conference on Combinatorics, Graph Theory and Computing