{"id":"W2008488464","doi":"10.1016/j.disopt.2007.11.003","title":"Solving mirrored traveling tournament problem benchmark instances with eight teams","year":2008,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":14,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Tournament; Benchmark (surveying); Mathematical optimization; Mathematics; Travelling salesman problem; Computer science; Tournament selection; Operations research; Combinatorics","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.00170996,0.001176909,0.00127607,0.0009843047,0.000707788,0.001364277,0.001949133,0.001809322,0.005535934],"category_scores_gemma":[0.006139043,0.0005263908,0.0008306298,0.001168988,0.0004369619,0.001128274,0.0007103725,0.001161175,0.0002932232],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001551767,"about_ca_system_score_gemma":0.001413889,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006690981,"about_ca_topic_score_gemma":0.006928296,"domain_scores_codex":[0.9991567,0.0003399944,0.00004096903,0.0001670052,0.0001165886,0.0001787247],"domain_scores_gemma":[0.9969485,0.002132875,0.0002163866,0.000227878,0.000228716,0.0002456705],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001135512,0.0009437566,0.002392687,0.0003257809,0.000184369,0.0002078833,0.00006394435,0.9350622,0.001606436,0.006023791,0.008017663,0.04403604],"study_design_scores_gemma":[0.0002853195,0.0004166524,0.0007536644,0.00001197608,0.00003148276,0.00003628648,0.00005638584,0.993453,0.001322377,0.002674402,0.000949473,0.000009037777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9463336,0.0003569908,0.03407628,0.0005706357,0.0002360622,0.0003121756,0.001483061,0.000548748,0.01608237],"genre_scores_gemma":[0.9284849,0.0001071535,0.06470279,0.0001011603,0.00005146342,0.0002672278,0.001575307,0.00009676227,0.004613178],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006690981,"threshold_uncertainty_score":0.01851952,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05474765679449342,"score_gpt":0.3143357916928812,"score_spread":0.2595881348983878,"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."}}