Pages that link to "Item:Q2576775"
From MaRDI portal
The following pages link to Robotic-cell scheduling: special polynomially solvable cases of the traveling salesman problem on permuted Monge matrices (Q2576775):
Displaying 3 items.
- On the asymptotic behavior of subtour-patching heuristics in solving the TSP on permuted Monge matrices (Q623315) (← links)
- Scheduling in reentrant robotic cells: algorithms and complexity (Q880491) (← links)
- The role of planarity in connectivity problems parameterized by treewidth (Q2514121) (← links)