{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001728914,0.001521848,0.002190868,0.001199095,0.0009466071,0.002536516,0.002247266,0.002881407,0.0115095],"category_scores_gemma":[0.005531079,0.001020918,0.001321882,0.002662248,0.001039228,0.004952258,0.002103436,0.001948789,0.001201451],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001570491,"about_ca_system_score_gemma":0.001206166,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002670396,"about_ca_topic_score_gemma":0.003415385,"domain_scores_codex":[0.999215,0.0003623487,0.00004438694,0.0001743701,0.00008130441,0.0001224303],"domain_scores_gemma":[0.997632,0.001838371,0.0001897236,0.00007890653,0.0001330671,0.0001279064],"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.0004256078,0.0002875895,0.001265097,0.000671021,0.0001248651,0.0002658111,0.0001611051,0.7459723,0.001650689,0.1539617,0.01418222,0.081032],"study_design_scores_gemma":[0.00005088052,0.0001242549,0.0002807836,0.00004137997,0.00003319496,0.00008705474,0.00009123893,0.8798631,0.0006568612,0.1157477,0.003009382,0.00001418583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.09350814,0.001526601,0.8709034,0.002736328,0.0001438979,0.0003890174,0.001920532,0.000307867,0.02856418],"genre_scores_gemma":[0.5376014,0.0023421,0.4204385,0.0004270486,0.0003835003,0.0008067907,0.002088437,0.0004381754,0.03547421],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0115095,"threshold_uncertainty_score":0.03850311,"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."}}