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

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.orl.2016.07.011 / rank
Normal rank
 
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.1016/j.orl.2016.07.011 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2482644989 / 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: 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
Property / DOI
 
Property / DOI: 10.1016/J.ORL.2016.07.011 / rank
 
Normal rank

Latest revision as of 08:32, 11 December 2024

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

    Statements

    Identifiers