首页 /研究 /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

发表年份
2005
引用次数
10

关键词

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

相关论文

查看 OTHER 分类全部论文