{"id":"W104314163","doi":"10.1023/a:1020759332183","title":"Minmax p-Traveling Salesmen Location Problems on a Tree","year":2002,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":false,"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"","keywords":"Theory of computation; Order (exchange); Time complexity; Mathematics; Combinatorics; Mathematical optimization; Computer science; Tree (set theory); Algorithm","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.001627502,0.00009112819,0.0001221774,0.0002935714,0.0001770178,0.00007422885,0.0001879121,0.00007625607,0.0002650216],"category_scores_gemma":[0.0006108829,0.00009408192,0.00003181607,0.0008994789,0.00006284735,0.0001706809,0.00002370264,0.0002709536,0.0001723501],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003890343,"about_ca_system_score_gemma":0.0000284636,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003022619,"about_ca_topic_score_gemma":0.00004310748,"domain_scores_codex":[0.9984837,0.0002054076,0.000297571,0.0001631229,0.0005543157,0.0002959007],"domain_scores_gemma":[0.9984186,0.000167903,0.00001075355,0.0003140609,0.001014542,0.00007417174],"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.000002147446,0.00006233554,0.00004203297,0.00005056815,0.00001831699,6.531538e-7,0.0008799633,0.9753057,0.005289101,0.001176754,0.005897051,0.01127541],"study_design_scores_gemma":[0.0001363471,0.00009526707,0.0004082911,0.00007637763,0.000001771142,0.00000140759,0.00009826066,0.9787734,0.01876463,0.00004154825,0.001507938,0.00009476833],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6126227,0.002327638,0.1864222,0.008453355,0.0003229359,0.002197426,0.00004271342,0.0006865304,0.1869246],"genre_scores_gemma":[0.9816766,0.0004886012,0.01568248,0.0000421495,0.00006934362,0.00006960019,0.000009835118,0.00003281801,0.001928537],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.369054,"threshold_uncertainty_score":0.3836549,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.3170685073406103,"score_gpt":0.4308538352548084,"score_spread":0.1137853279141982,"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."}}