{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001104623,0.001053105,0.001543169,0.0009155379,0.0006817192,0.001475604,0.001327458,0.001344723,0.004005044],"category_scores_gemma":[0.003316323,0.0005285028,0.0008164805,0.002369997,0.0009026531,0.001795396,0.001019447,0.001473238,0.0007051089],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001177792,"about_ca_system_score_gemma":0.001408123,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004956917,"about_ca_topic_score_gemma":0.004092297,"domain_scores_codex":[0.9990547,0.0003761611,0.00003155806,0.0001148602,0.0003070176,0.0001156976],"domain_scores_gemma":[0.9993099,0.0004231931,0.00006668657,0.00005571589,0.0001094562,0.00003505533],"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.00004840989,0.00004684509,0.0002073374,0.0001389553,0.00002969873,0.00005682805,0.00005355855,0.8241432,0.0007595451,0.08108983,0.005052144,0.08837354],"study_design_scores_gemma":[0.00001556038,0.00001650031,0.00006059652,0.00002120391,0.000008714809,0.00003705767,0.00001601893,0.939029,0.0002939158,0.05712464,0.003370825,0.000006045397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004792051,0.0006288363,0.9891991,0.0002256708,0.00004261345,0.00007353731,0.00009036794,0.0001352682,0.004812587],"genre_scores_gemma":[0.1667164,0.001882761,0.8258023,0.0001481797,0.0001414795,0.0003834955,0.0006327169,0.0001990662,0.004093647],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004956917,"threshold_uncertainty_score":0.01339823,"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."}}