Robotic-Cell Scheduling: Special Polynomially Solvable Cases of the Traveling Salesman Problem on Permuted Monge Matrices

Vladimir G. Deineko, George Steiner, Zhihui Xue. Robotic-Cell Scheduling: Special Polynomially Solvable Cases of the Traveling Salesman Problem on Permuted Monge Matrices. J. Comb. Optim., 9(4):381-399, 2005. [doi]

Abstract

Abstract is missing.