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

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
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 ILS heuristic for the traveling tournament problem with predefined venues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4475665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: Complexity of the traveling tournament problem / rank
 
Normal rank

Revision as of 19:49, 17 July 2024

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

    Statements

    Identifiers