Robotic-cell scheduling: special polynomially solvable cases of the traveling salesman problem on permuted Monge matrices (Q2576775)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Robotic-cell scheduling: special polynomially solvable cases of the traveling salesman problem on permuted Monge matrices |
scientific article |
Statements
Robotic-cell scheduling: special polynomially solvable cases of the traveling salesman problem on permuted Monge matrices (English)
0 references
14 December 2005
0 references
robotic-cell scheduling
0 references
traveling salesman problem
0 references
permuted Monge matrix
0 references
polynomial-time algorithm
0 references
0 references
0 references
