Pages that link to "Item:Q627544"
From MaRDI portal
The following pages link to 35/44-approximation for asymmetric maximum TSP with triangle inequality (Q627544):
Displaying 11 items.
- An experimental study of a hybrid genetic algorithm for the maximum traveling salesman problem (Q387104) (← links)
- Limitations of incremental dynamic programming (Q517805) (← links)
- An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality (Q866548) (← links)
- A note on the approximation of the asymmetric traveling salesman problem. (Q1417511) (← links)
- Maximum ATSP with weights zero and one via half-edges (Q1743116) (← links)
- Approximation of the double traveling salesman problem with multiple stacks (Q2034797) (← links)
- Efficient PTAS for the maximum traveling salesman problem in a metric space of fixed doubling dimension (Q2162693) (← links)
- Simpler approximation of the maximum asymmetric traveling salesman problem (Q2904788) (← links)
- (Q4471353) (← links)
- A new approximation algorithm for the asymmetric TSP with triangle inequality (Q4962752) (← links)
- STACS 2004 (Q5309723) (← links)