{"id":"W1976051387","doi":"10.1016/j.disopt.2008.12.004","title":"A Benders approach for computing lower bounds for the mirrored traveling tournament problem","year":2009,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":8,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Tournament; Benchmark (surveying); Benders' decomposition; Mathematical optimization; Mathematics; Tournament selection; Upper and lower bounds; Computer science; 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.003525811,0.002018841,0.001907654,0.002577294,0.0009995741,0.003085871,0.003024922,0.002118825,0.01274959],"category_scores_gemma":[0.01402868,0.001489568,0.002404266,0.00271563,0.001399795,0.003773054,0.002014805,0.004417202,0.001681146],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001924134,"about_ca_system_score_gemma":0.001995798,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004477689,"about_ca_topic_score_gemma":0.004693367,"domain_scores_codex":[0.9983834,0.0005903241,0.00008784239,0.0003084966,0.0004300585,0.0001999992],"domain_scores_gemma":[0.9953715,0.003302201,0.0003240684,0.0004108312,0.0003980809,0.0001932948],"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.0003190523,0.0002683692,0.0006168134,0.000190846,0.0001303644,0.00006248349,0.0001233216,0.7639374,0.00208198,0.09951786,0.005864359,0.1268872],"study_design_scores_gemma":[0.00003903243,0.00007009875,0.0001008335,0.00002120294,0.00002284835,0.00001297835,0.00001554369,0.9377015,0.0004940509,0.06062101,0.0008873779,0.00001359344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01203373,0.0002404625,0.9821234,0.0002659622,0.00007740037,0.00007773844,0.0001468896,0.0005008062,0.004533546],"genre_scores_gemma":[0.1830671,0.0005638121,0.8067288,0.0003179923,0.0002440002,0.0004552953,0.0009359858,0.0004437012,0.007243289],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01274959,"threshold_uncertainty_score":0.04265159,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.107184687758087,"score_gpt":0.382185916378766,"score_spread":0.275001228620679,"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."}}