The Product Matrix Traveling Salesman Problem: An Application and Solution Heuristic
From MaRDI portal
Recommendations
Cited in
(13)- Darts and hoopla board design
- An O(n) algorithm to solve the Bottleneck Traveling Salesman Problem restricted to ordered product matrices
- Selection and sequencing heuristics to reduce variance in gas turbine engine nozzle assemblies
- The balanced traveling salesman problem
- On the asymptotic behavior of subtour-patching heuristics in solving the TSP on permuted Monge matrices
- Most and least uniform spanning trees
- Efficiently solvable special cases of hard combinatorial optimization problems
- An approximation algorithm for the (metric) clustered path traveling salesman problem
- An approximation algorithm for the clustered path travelling salesman problem
- An approximation algorithm for the clustered path travelling salesman problem
- A variable neighborhood search algorithm for cost-balanced travelling salesman problem
- Efficient filtering for the resource-cost alldifferent constraint
- A branch-and-cut algorithm for the balanced traveling salesman problem
This page was built for publication: The Product Matrix Traveling Salesman Problem: An Application and Solution Heuristic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3775351)