{"id":"W4301154667","doi":"","title":"The Generalized Minimum Spanning Tree Problem: Polyhedral Analysis and Branch-and-Cut Algorithm","year":2002,"lang":"en","type":"article","venue":"","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université Laval","funders":"","keywords":"Minimum spanning tree; Spanning tree; Distributed minimum spanning tree; Computer science; Tree (set theory); Combinatorics; Algorithm; Steiner tree problem; Mathematics","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.0002998283,0.0001444342,0.0002061562,0.0001238422,0.0001773424,0.0001368834,0.00008771411,0.00006356784,0.00009819227],"category_scores_gemma":[0.00002786728,0.0001078542,0.00006025737,0.0005280049,0.00005056391,0.00009800948,0.00003847789,0.000103559,0.000005218129],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001654524,"about_ca_system_score_gemma":0.000002109382,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000329078,"about_ca_topic_score_gemma":0.00004018866,"domain_scores_codex":[0.9991317,0.00007391244,0.0002349577,0.0001803556,0.0001216095,0.0002574628],"domain_scores_gemma":[0.9995281,0.0001415839,0.00003061926,0.0001880706,0.00002598782,0.00008562813],"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.000005129159,0.00001892766,0.01035252,0.00003445718,0.001119341,0.000005292309,0.001649957,0.11161,0.003018653,0.0005937038,0.001535917,0.8700561],"study_design_scores_gemma":[0.0003276291,0.000009221518,0.002505772,0.000003680703,0.0001532616,0.000006820772,0.00004141567,0.9952263,0.0007680732,0.00006959946,0.0007346442,0.0001535295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07354202,0.002064958,0.9119493,0.00067687,0.0001011809,0.0001798201,0.000003786598,0.000506306,0.01097573],"genre_scores_gemma":[0.3175614,0.0006660003,0.6771042,0.00009952378,0.00009888103,0.00001757809,0.000004295595,0.00004360902,0.004404584],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8836164,"threshold_uncertainty_score":0.4398169,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01486572632310597,"score_gpt":0.2394272872546061,"score_spread":0.2245615609315001,"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."}}