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

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

Vladimir G. Deı̌neko, George Steiner, Zhihui Xue

Year
2005
Citations
10

Keywords

Travelling salesman problemTheory of computationScheduling (production processes)MathematicsComputer scienceImplementationCombinatoricsMathematical optimizationAlgorithm

Related papers

Browse all OTHER papers