A multi-round generalization of the traveling tournament problem and its application to Japanese baseball (Q421692): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2011.06.014 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2002856610 / 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: Q4361574 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving mirrored traveling tournament problem benchmark instances with eight teams / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Benders approach for computing lower bounds for the mirrored 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: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4475665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5538306 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new branch-and-price algorithm for the 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: On the application of graph colouring techniques in round-robin sports scheduling / 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: A Benders approach for the constrained minimum break problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Round robin scheduling -- a survey / 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: Complexity of the traveling tournament problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: DFS* and the Traveling Tournament Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4332941 / rank
 
Normal rank

Latest revision as of 05:52, 5 July 2024

scientific article
Language Label Description Also known as
English
A multi-round generalization of the traveling tournament problem and its application to Japanese baseball
scientific article

    Statements

    A multi-round generalization of the traveling tournament problem and its application to Japanese baseball (English)
    0 references
    0 references
    0 references
    14 May 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    scheduling
    0 references
    timetabling
    0 references
    graph theory
    0 references
    perfect matchings
    0 references
    one-factorization
    0 references
    traveling tournament problem
    0 references
    0 references