{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006876548,0.0008868217,0.001524575,0.001263813,0.001085536,0.00136456,0.001715371,0.002185735,0.00860671],"category_scores_gemma":[0.003126018,0.0006817277,0.0007842899,0.002252338,0.0004370456,0.001709955,0.001536887,0.002122859,0.001481067],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009671159,"about_ca_system_score_gemma":0.00198365,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004159729,"about_ca_topic_score_gemma":0.00516033,"domain_scores_codex":[0.9994078,0.0001328057,0.00002964321,0.0001140049,0.0002203704,0.00009533676],"domain_scores_gemma":[0.9991373,0.0004571982,0.00004925193,0.00007567848,0.0001800271,0.0001005334],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005056826,0.0005316644,0.000740014,0.0003819733,0.0000892348,0.000176934,0.0001578719,0.29571,0.007962533,0.03069439,0.02289389,0.6401559],"study_design_scores_gemma":[0.0001705874,0.0001268456,0.0002662144,0.00003101193,0.00003174115,0.0001049881,0.00004377022,0.9709812,0.00149465,0.02160517,0.005129479,0.00001429253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02258405,0.0006021335,0.9658373,0.0007013308,0.0001614729,0.0002979156,0.0003888406,0.001053934,0.008373069],"genre_scores_gemma":[0.08073921,0.0003230158,0.9135734,0.0001462291,0.0000753497,0.0002542076,0.0008082086,0.0001806324,0.003899849],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00860671,"threshold_uncertainty_score":0.02879226,"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."}}