{"id":"W4382930395","doi":"10.1016/j.orl.2023.06.006","title":"Unconstrained traveling tournament problem is APX-complete","year":2023,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tournament; Hamiltonian path; Combinatorics; Complete graph; Mathematics; Travelling salesman problem; APX; Graph; Mathematical optimization; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science; Artificial intelligence; Physics","routes":{"ca_aff":true,"ca_fund":true,"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.001730694,0.0001285667,0.00013338,0.0003834205,0.0004647801,0.0003014853,0.0002477888,0.00005409122,0.0002815295],"category_scores_gemma":[0.0001328248,0.0001343492,0.00005097346,0.001422402,0.00008851163,0.0001891859,0.00005889782,0.0004455558,0.0005710966],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001809232,"about_ca_system_score_gemma":0.00005545469,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004127171,"about_ca_topic_score_gemma":0.00001529288,"domain_scores_codex":[0.998109,0.0002309032,0.0002981581,0.0002417622,0.0005367767,0.0005834287],"domain_scores_gemma":[0.9992477,0.0001669643,0.000007031354,0.0002979259,0.0001494663,0.0001309492],"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.000001157691,0.00000589451,0.00004504759,0.00002304046,0.00002712858,0.0000105467,0.001049423,0.8507766,0.1258481,0.0002258072,0.01705015,0.004937197],"study_design_scores_gemma":[0.0002671065,0.00001570336,0.0001531908,0.00003831655,0.000003693915,0.000005716967,0.0003188698,0.9856899,0.004918342,0.00003695728,0.008384718,0.000167503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5316176,0.00007671212,0.4113208,0.04497036,0.000452286,0.001485015,0.00009998147,0.001834789,0.008142457],"genre_scores_gemma":[0.7157285,0.0001623138,0.2801165,0.001244566,0.0003942128,0.0003799116,0.0001398115,0.0001469018,0.001687245],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.184111,"threshold_uncertainty_score":0.7340482,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09799900504041466,"score_gpt":0.3645096889024662,"score_spread":0.2665106838620516,"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."}}