Pages that link to "Item:Q4268895"
From MaRDI portal
The following pages link to On the Maximum Scatter Traveling Salesperson Problem (Q4268895):
Displaying 7 items.
- The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis (Q336878) (← links)
- Experimental analysis of heuristics for the bottleneck traveling salesman problem (Q519098) (← links)
- The balanced traveling salesman problem (Q614063) (← links)
- The traveling salesman problem on grids with forbidden neighborhoods (Q1680496) (← links)
- A linear time algorithm for the \(3\)-neighbour travelling salesman problem on a Halin graph and extensions (Q1751254) (← links)
- Minimizing the number of workers in a paced mixed-model assembly line (Q1991120) (← links)
- A branch-and-cut algorithm for the balanced traveling salesman problem (Q6123381) (← links)