Pages that link to "Item:Q3775351"
From MaRDI portal
The following pages link to The Product Matrix Traveling Salesman Problem: An Application and Solution Heuristic (Q3775351):
Displaying 12 items.
- The balanced traveling salesman problem (Q614063) (← links)
- On the asymptotic behavior of subtour-patching heuristics in solving the TSP on permuted Monge matrices (Q623315) (← links)
- Darts and hoopla board design (Q834892) (← links)
- Most and least uniform spanning trees (Q1087546) (← links)
- An \(O(n)\) algorithm to solve the Bottleneck Traveling Salesman Problem restricted to ordered product matrices (Q1314323) (← links)
- Efficiently solvable special cases of hard combinatorial optimization problems (Q1365047) (← links)
- Efficient filtering for the resource-cost alldifferent constraint (Q1701236) (← links)
- A Variable Neighborhood Search Algorithm for Cost-Balanced Travelling Salesman Problem (Q5011677) (← links)
- Selection and sequencing heuristics to reduce variance in gas turbine engine nozzle assemblies (Q5939582) (← links)
- An approximation algorithm for the clustered path travelling salesman problem (Q6039533) (← links)
- A branch-and-cut algorithm for the balanced traveling salesman problem (Q6123381) (← links)
- An approximation algorithm for the clustered path travelling salesman problem (Q6167001) (← links)