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 18 items.
- Experimental analysis of heuristics for the bottleneck traveling salesman problem (Q519098) (← links)
- The balanced traveling salesman problem (Q614063) (← links)
- A class of exponential neighbourhoods for the quadratic travelling salesman problem (Q782742) (← links)
- An approximation algorithm for a bottleneck traveling salesman problem (Q1026245) (← links)
- Best possible heuristics for the bottleneck wandering salesperson and bottleneck vehicle routing problem (Q1079133) (← links)
- A linear time algorithm for the \(3\)-neighbour travelling salesman problem on a Halin graph and extensions (Q1751254) (← links)
- A data-guided lexisearch algorithm for the bottleneck travelling salesman problem (Q1758845) (← links)
- The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints (Q1806889) (← links)
- Minimizing the number of workers in a paced mixed-model assembly line (Q1991120) (← links)
- High multiplicity asymmetric traveling salesman problem with feedback vertex set and its application to storage/retrieval system (Q2029029) (← links)
- Optimal toll design: a lower bound framework for the asymmetric traveling salesman problem (Q2452379) (← links)
- The Uncapacitated Asymmetric Traveling Salesman Problem with Multiple Stacks (Q3167617) (← links)
- An Algorithm for the Bottleneck Traveling Salesman Problem (Q3328310) (← links)
- Some remarks on two degrees of asymmetry in the traveling salesman problem (Q3801365) (← links)
- (Q4801179) (← links)
- (Q4875205) (← 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)
