{"id":"W292355835","doi":"10.1609/aaai.v28i1.9031","title":"Solving the Traveling Tournament Problem by Packing Three-Vertex Paths","year":2014,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":17,"is_retracted":false,"has_abstract":true,"ca_institutions":"Quest University Canada","funders":"","keywords":"Tournament; Schedule; Mathematical optimization; Vertex (graph theory); Integer programming; TRIPS architecture; Computer science; Scheduling (production processes); Job shop scheduling; Graph; Benchmark (surveying); Mathematics; Theoretical computer science; Combinatorics; Geography; Parallel computing","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005604364,0.0007304477,0.000596648,0.0004640549,0.0006162995,0.0008172955,0.0009692652,0.0006626226,0.004659725],"category_scores_gemma":[0.001749126,0.0003237826,0.0006817059,0.0009580389,0.0004951743,0.0009189134,0.0006498778,0.0007906171,0.0003795365],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005336165,"about_ca_system_score_gemma":0.001083782,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003862358,"about_ca_topic_score_gemma":0.004349003,"domain_scores_codex":[0.9996274,0.0001396387,0.00001518441,0.00007098578,0.00005840942,0.00008848548],"domain_scores_gemma":[0.9994614,0.0002913029,0.00005926006,0.00006481136,0.000051216,0.00007208913],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001804662,0.0001837075,0.001502187,0.0001416236,0.00005581548,0.0002518846,0.0001714444,0.8677598,0.003074734,0.02723936,0.004662829,0.09477616],"study_design_scores_gemma":[0.00007472246,0.000261868,0.0003539555,0.00001056131,0.00002419001,0.0001125798,0.0001314193,0.9698429,0.001858568,0.02361929,0.003698784,0.00001121475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3304256,0.0001855662,0.6478846,0.0003118968,0.00008238627,0.0003543621,0.0003900854,0.0006774107,0.01968792],"genre_scores_gemma":[0.6002585,0.0002403563,0.3946563,0.0000725965,0.0000268624,0.0002241256,0.0009062676,0.0001638289,0.003451216],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004659725,"threshold_uncertainty_score":0.01558828,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1606617041288866,"score_gpt":0.3545316250140712,"score_spread":0.1938699208851846,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}