An improved approximation algorithm for the traveling tournament problem with maximum trip length two
From MaRDI portal
Publication:4608653
Recommendations
- An Improved Approximation Algorithm for the Traveling Tournament Problem
- An improved approximation algorithm for the traveling tournament problem
- Approximating the traveling tournament problem with maximum tour length 2
- Approximation algorithms for \(\mathrm{TTP(2)}\)
- An approximation algorithm for the traveling tournament problem
Cited in
(15)- An approximation algorithm for the bipartite traveling tournament problem
- A multi-round generalization of the traveling tournament problem and its application to Japanese baseball
- scientific article; zbMATH DE number 2084735 (Why is no real title available?)
- A complete search method for the relaxed traveling tournament problem
- An improved scheduling algorithm for traveling tournament problem with maximum trip length two
- A further improvement on approximating TTP-2
- Scheduling bipartite tournaments to minimize total travel distance
- An approximation algorithm for the traveling tournament problem
- A 2.75-approximation algorithm for the unconstrained traveling tournament problem
- Approximation algorithms for \(\mathrm{TTP(2)}\)
- An improved approximation algorithm for the traveling tournament problem
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- A simulated annealing and hill-climbing algorithm for the traveling tournament problem
- Approximating the traveling tournament problem with maximum tour length 2
- An Improved Approximation Algorithm for the Traveling Tournament Problem
This page was built for publication: An improved approximation algorithm for the traveling tournament problem with maximum trip length two
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4608653)
