{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01136009,0.00008547569,0.0001824497,0.0002871729,0.00101893,0.001027733,0.0008334147,0.00005413039,0.0003635784],"category_scores_gemma":[0.003113458,0.00004921268,0.00008642717,0.0009400326,0.0001742215,0.0004865716,0.00006686601,0.0001925773,0.0002543943],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003376762,"about_ca_system_score_gemma":0.0001611567,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001499823,"about_ca_topic_score_gemma":0.00004005828,"domain_scores_codex":[0.9969745,0.0002134706,0.0007369554,0.0002469427,0.001500992,0.0003271432],"domain_scores_gemma":[0.9936688,0.002591514,0.00007437898,0.0007880247,0.002777917,0.00009939879],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007493646,0.002027055,0.00008163021,0.00008069906,0.0001540717,3.761176e-7,0.020601,0.2561401,0.03183889,0.1638596,0.008830124,0.5163789],"study_design_scores_gemma":[0.0001467367,0.00008616108,0.00007728326,0.0000198891,0.000009270664,0.000002107752,0.00478518,0.937607,0.002890782,0.05394461,0.0003738806,0.00005711867],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05806725,0.00009692105,0.9367973,0.002848706,0.00006489315,0.001544489,0.00002059854,0.00002173913,0.0005381074],"genre_scores_gemma":[0.3566419,0.00001170597,0.6409079,0.00001555698,0.00008339339,0.0006855933,0.000007495819,0.00001201232,0.001634476],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6814669,"threshold_uncertainty_score":0.9910452,"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."}}