A 5.875-approximation for the traveling tournament problem (Q475212): 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: Heuristics for the mirrored traveling tournament problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling in Sports / 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: A simulated annealing and hill-climbing 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: Complexity of the traveling tournament problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Approximation Algorithm for the Traveling Tournament Problem / rank
 
Normal rank

Revision as of 08:11, 9 July 2024

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

    Statements

    Identifiers