A beam search approach to the traveling tournament problem (Q2057120): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-030-43680-3_5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3016075270 / 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: Decision diagrams for optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4475665 / 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: 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

Latest revision as of 11:33, 27 July 2024

scientific article
Language Label Description Also known as
English
A beam search approach to the traveling tournament problem
scientific article

    Statements

    A beam search approach to the traveling tournament problem (English)
    0 references
    0 references
    0 references
    0 references
    8 December 2021
    0 references
    traveling tournament problem
    0 references
    beam search
    0 references
    decision diagrams
    0 references

    Identifiers