{"id":"W2167459401","doi":"10.1002/net.10105","title":"The generalized minimum spanning tree problem: Polyhedral analysis and branch‐and‐cut algorithm","year":2004,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":31,"is_retracted":false,"has_abstract":true,"ca_institutions":"HEC Montréal","funders":"Fonds pour la Formation à la Recherche dans l’Industrie et dans l’Agriculture; Natural Sciences and Engineering Research Council of Canada","keywords":"Minimum spanning tree; Steiner tree problem; Spanning tree; Branch and cut; k-minimum spanning tree; Tabu search; Vertex (graph theory); Mathematics; Integer programming; Combinatorics; Kruskal's algorithm; Euclidean geometry; Heuristic; Algorithm; Graph; Mathematical optimization; Tree structure; K-ary tree; Binary tree","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001009007,0.0008960795,0.001239285,0.0008098817,0.0005877455,0.0014113,0.001090056,0.001225531,0.004519155],"category_scores_gemma":[0.003020824,0.0004701259,0.0007760337,0.0017684,0.0008189178,0.001392379,0.0009424989,0.001272266,0.0005789682],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00106662,"about_ca_system_score_gemma":0.001240908,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004785267,"about_ca_topic_score_gemma":0.003815241,"domain_scores_codex":[0.999276,0.0003113823,0.00002283685,0.00009419881,0.0002049288,0.00009063884],"domain_scores_gemma":[0.9992605,0.000476835,0.00006881964,0.00005423845,0.0001009915,0.00003853035],"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.00005241888,0.00005136869,0.0002218403,0.0001129206,0.0000284407,0.00005302711,0.00005252641,0.8524824,0.0007760806,0.06494136,0.004267103,0.07696047],"study_design_scores_gemma":[0.0000147849,0.00001418844,0.00004619372,0.00001424292,0.000005742565,0.00002479685,0.00001284994,0.9639839,0.000220473,0.03399212,0.00166745,0.000003379681],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01184139,0.0005074108,0.9808301,0.0002849494,0.00004931179,0.0000935694,0.0001011216,0.0001667086,0.006125459],"genre_scores_gemma":[0.2225312,0.0009454387,0.7710676,0.0001425062,0.0001096353,0.0003437739,0.0005739114,0.0001670808,0.00411874],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004785267,"threshold_uncertainty_score":0.01511812,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007846760493643152,"score_gpt":0.2338371477629094,"score_spread":0.2259903872692662,"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."}}