The following pages link to (Q4461914):
Displayed 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)
- Asymptotically optimal algorithm for finding one and two edge-disjoint traveling salesman routes of maximal weight in Euclidean space (Q735647) (← links)
- Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems (Q833572) (← links)
- A \(\frac78\)-approximation algorithm for metric Max TSP (Q1847381) (← links)
- Factoring a band matrix over a semiring (Q2041261) (← links)
- Efficient PTAS for the maximum traveling salesman problem in a metric space of fixed doubling dimension (Q2162693) (← links)
- Asymptotically optimal algorithms for geometric MAX TSP and MAX \(m\)-PSP (Q2434738) (← links)
- On the core of multiple longest traveling salesman games (Q2503251) (← links)
- A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem (Q2660410) (← links)
- Instance Guaranteed Ratio on Greedy Heuristic for Genome Scaffolding (Q2958322) (← links)