Pages that link to "Item:Q336878"
From MaRDI portal
The following pages link to The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis (Q336878):
Displaying 6 items.
- The balanced traveling salesman problem (Q614063) (← links)
- A class of exponential neighbourhoods for the quadratic travelling salesman problem (Q782742) (← 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)
- Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin–Marsten bounding (Q5865336) (← links)
- A branch-and-cut algorithm for the balanced traveling salesman problem (Q6123381) (← links)
