The University of Warwick Library - WebBridge

Robotic-cell scheduling: Special polynomially solvable cases of the traveling salesman problem on permuted Monge matrices
JOURNAL OF COMBINATORIAL OPTIMIZATION.  v. 9. no. 4.   2005-06. p. 381 - 399... issn: 1382-6905 .   

Online access not found

Sorry - based on the information provided, WebBridge cannot offer appropriate links.