{"id":"W2550142813","doi":"10.1016/j.cor.2016.11.010","title":"A branch-and-cut algorithm for the minimum branch vertices spanning tree problem","year":2016,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":false,"ca_institutions":"HEC Montréal","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Minimum spanning tree; Spanning tree; k-minimum spanning tree; Combinatorics; Undirected graph; Mathematics; Kruskal's algorithm; Branch and cut; Connected dominating set; Context (archaeology); Steiner tree problem; Graph; Discrete mathematics; Integer programming; Algorithm; K-ary tree; Tree structure; 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.0003657401,0.0001285421,0.0001395864,0.0001288765,0.0004532283,0.0001736838,0.0004080032,0.00008155232,0.000008207037],"category_scores_gemma":[0.0001298008,0.00007743792,0.00003810275,0.0003472888,0.0003143143,0.0002716828,0.0001913291,0.0002401911,0.00002605547],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006924109,"about_ca_system_score_gemma":0.00002546885,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005630786,"about_ca_topic_score_gemma":0.00005302037,"domain_scores_codex":[0.9988002,0.00003875067,0.0001906958,0.000251129,0.0002222309,0.00049701],"domain_scores_gemma":[0.9981001,0.001323869,0.000005765708,0.0003406907,0.0001630849,0.00006646681],"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.000005182812,0.00001260688,0.00002398688,0.00002106632,0.00004401943,0.000001256504,0.0001652481,0.02909707,0.003715091,0.002925147,0.002814833,0.9611745],"study_design_scores_gemma":[0.000504408,0.0001075721,0.0002407032,0.0001018291,0.000007261706,0.00000579768,0.00006935362,0.9835768,0.002066471,0.00222465,0.01093805,0.0001571174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01331813,0.001287141,0.9802786,0.003629309,0.0001622328,0.0007413494,0.000009372966,0.0003674368,0.0002064739],"genre_scores_gemma":[0.643599,0.0006867464,0.3542812,0.00004912641,0.0002630376,0.0005837969,0.000004198962,0.00004993333,0.0004829769],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9610174,"threshold_uncertainty_score":0.3485911,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04101824361436544,"score_gpt":0.3218208047011121,"score_spread":0.2808025610867466,"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."}}