{"id":"W1971938577","doi":"10.1287/moor.2013.0597","title":"An Approximation Algorithm for the Bipartite Traveling Tournament Problem","year":2013,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":15,"is_retracted":false,"has_abstract":true,"ca_institutions":"Quest University Canada","funders":"","keywords":"Tournament; Bipartite graph; Travelling salesman problem; Mathematics; Schedule; Approximation algorithm; Scheduling (production processes); Mathematical optimization; Combinatorics; League; Sequence (biology); Computer science; Graph","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.001364893,0.00167081,0.001447752,0.0009680257,0.001263055,0.002165618,0.002660846,0.00179714,0.01032507],"category_scores_gemma":[0.006150695,0.0006519262,0.001499183,0.002393743,0.0006736019,0.002764468,0.001746017,0.002189919,0.00235975],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002881112,"about_ca_system_score_gemma":0.003744024,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008182343,"about_ca_topic_score_gemma":0.009087175,"domain_scores_codex":[0.9980407,0.000435878,0.0001031546,0.0004874856,0.0004746682,0.0004580504],"domain_scores_gemma":[0.9980807,0.0009527889,0.0001707139,0.0004219317,0.0002162132,0.0001576304],"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.00079583,0.0006560101,0.001776841,0.0004573309,0.0001514831,0.0002317614,0.0003452591,0.6052005,0.005519398,0.06131678,0.03488039,0.2886684],"study_design_scores_gemma":[0.0001798038,0.0001154951,0.0002752999,0.00002298093,0.00003328279,0.0001555237,0.00007705643,0.9588092,0.0008230326,0.03423231,0.005259041,0.00001702893],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03592926,0.0006044573,0.9411748,0.001240376,0.0001958776,0.0003459706,0.0007577394,0.003257797,0.01649369],"genre_scores_gemma":[0.2795419,0.000499461,0.7098688,0.0003960852,0.0001489866,0.0005641536,0.002623716,0.0004435231,0.00591337],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01032507,"threshold_uncertainty_score":0.03454083,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.3518717323001682,"score_gpt":0.5090074774307536,"score_spread":0.1571357451305854,"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."}}