{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002574597,0.0001500874,0.0002071653,0.0001102137,0.0009957278,0.0006207232,0.0004300314,0.00007782656,0.00001819756],"category_scores_gemma":[0.001043413,0.00009651772,0.0002331033,0.000531185,0.00005241294,0.0002108154,0.00002264412,0.00009353835,0.000002197469],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004735213,"about_ca_system_score_gemma":0.00007091594,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007874716,"about_ca_topic_score_gemma":0.000002074074,"domain_scores_codex":[0.9980841,0.00005868141,0.0005429601,0.0004327815,0.0005174792,0.0003639922],"domain_scores_gemma":[0.9981214,0.0007702323,0.0002721612,0.0003461842,0.0004153757,0.0000746087],"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.00005616245,0.00004765323,0.00002235971,0.000002864944,0.00002253001,5.647117e-8,0.0006428819,0.9862167,0.0000273687,0.002623122,0.0007964669,0.009541853],"study_design_scores_gemma":[0.0006663783,0.0001186358,0.0001055401,0.00001293053,0.00006071318,0.000001978197,0.001326025,0.9915622,0.00003316566,0.004966252,0.001005998,0.0001401832],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0006502611,0.0001616261,0.993755,0.003061305,0.0002606387,0.001032345,0.00002136403,0.00006178504,0.000995675],"genre_scores_gemma":[0.4400842,0.000005655114,0.5590467,0.0002393343,0.0001125166,0.0000424902,0.00006403602,0.00001159991,0.0003934804],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4394339,"threshold_uncertainty_score":0.7658435,"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."}}