An improved approximation algorithm for the traveling tournament problem (Q652542): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4475665 / 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 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 |
Latest revision as of 17:33, 4 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An improved approximation algorithm for the traveling tournament problem |
scientific article |
Statements
An improved approximation algorithm for the traveling tournament problem (English)
0 references
14 December 2011
0 references
traveling tournament problem
0 references
approximation algorithm
0 references
lower bound
0 references
timetabling
0 references
scheduling
0 references