{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003816205,0.0001573924,0.0002203279,0.00008323912,0.0002148684,0.0001328886,0.00009784612,0.0001115742,0.000005832197],"category_scores_gemma":[0.00001613313,0.0001287291,0.00006378049,0.0005893055,0.00006018737,0.00007621438,0.00004358081,0.0001975293,9.791976e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000325426,"about_ca_system_score_gemma":0.000008415862,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003259247,"about_ca_topic_score_gemma":0.00006260906,"domain_scores_codex":[0.9990746,0.00006508667,0.0002342908,0.000193054,0.0001105773,0.000322348],"domain_scores_gemma":[0.99954,0.0001041719,0.00004267708,0.0001946638,0.00002621631,0.00009226634],"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.000003507027,0.000002482661,0.001722667,0.000004442463,0.0001924672,0.000001773022,0.000220211,0.8721574,0.00004830695,0.0001012039,0.00004730618,0.1254983],"study_design_scores_gemma":[0.0005666647,0.00001209014,0.0057291,0.00001385537,0.0001796178,0.000007537718,0.0000229908,0.9927196,0.00009075899,0.0002292696,0.0002668152,0.0001617325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05134978,0.002307554,0.9450269,0.0002079398,0.0001514938,0.0001238404,0.000001491025,0.0002317071,0.0005992386],"genre_scores_gemma":[0.6561824,0.0006537415,0.3425233,0.00008959277,0.0003077041,0.00001978549,0.00001043349,0.00004644696,0.0001666011],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6048326,"threshold_uncertainty_score":0.5249419,"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."}}