A 2.75-approximation algorithm for the unconstrained traveling tournament problem (Q475199): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An improved approximation algorithm for the traveling tournament problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4475665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling in sports: an annotated bibliography / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for the traveling tournament problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Round robin scheduling -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Traveling Tournament Problem with Maximum Tour Length 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of the traveling tournament problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing breaks and bounding solutions to the mirrored traveling tournament problem / rank
 
Normal rank

Latest revision as of 09:11, 9 July 2024

scientific article
Language Label Description Also known as
English
A 2.75-approximation algorithm for the unconstrained traveling tournament problem
scientific article

    Statements

    A 2.75-approximation algorithm for the unconstrained traveling tournament problem (English)
    0 references
    0 references
    0 references
    0 references
    26 November 2014
    0 references
    timetable
    0 references
    sports scheduling
    0 references
    traveling tournament problem
    0 references
    approximation algorithm
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references