Complexity of the traveling tournament problem (Q620946): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q57851410 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4475665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simulated annealing approach to the traveling tournament problem / 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: A 5.875-approximation for the traveling tournament problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Approximation Algorithm for the Traveling Tournament Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 2.75-approximation algorithm for the unconstrained traveling tournament problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling in sports: an annotated bibliography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Round robin scheduling -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of finding maximum disjoint paths with length constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling in Sports / rank
 
Normal rank

Latest revision as of 17:57, 3 July 2024

scientific article
Language Label Description Also known as
English
Complexity of the traveling tournament problem
scientific article

    Statements

    Identifiers