{"id":"W2094626628","doi":"10.1002/net.20485","title":"Branch‐and‐cut and hybrid local search for the multi‐level capacitated minimum spanning tree problem","year":2011,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Minimum spanning tree; Spanning tree; GRASP; Benchmark (surveying); Mathematical optimization; Branch and cut; Branch and bound; Polyhedron; Mathematics; Tree (set theory); Computer science; Cutting-plane method; Combinatorics; Linear programming; Integer programming","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.00189377,0.0008518237,0.001149748,0.001047842,0.0005458893,0.001184314,0.001347371,0.001201096,0.004097934],"category_scores_gemma":[0.004442106,0.0005881453,0.0006339031,0.001470089,0.0008627792,0.001600832,0.001466622,0.001544101,0.0006106453],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001118876,"about_ca_system_score_gemma":0.001175184,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002698143,"about_ca_topic_score_gemma":0.002798276,"domain_scores_codex":[0.9990935,0.0004032245,0.00002965371,0.0001103953,0.0002435274,0.0001196861],"domain_scores_gemma":[0.9983937,0.001095762,0.0001535648,0.0001330208,0.00014799,0.00007596058],"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.00008984581,0.00006986623,0.0003227518,0.00007903461,0.00003187217,0.00002256976,0.00005385972,0.9255297,0.001067064,0.01531398,0.001492507,0.05592686],"study_design_scores_gemma":[0.00001911126,0.00002655341,0.00006049587,0.000006923444,0.000004639717,0.000007466172,0.000008441775,0.9940402,0.0004517924,0.00500625,0.0003647273,0.000003356722],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03583719,0.0004271654,0.9586831,0.0002448444,0.00002312114,0.00007332434,0.0000729468,0.000495382,0.004142909],"genre_scores_gemma":[0.4598446,0.0002403782,0.5367218,0.0001187947,0.00003974619,0.0004245168,0.0002747537,0.0001871389,0.002148388],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004097934,"threshold_uncertainty_score":0.01370895,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06862574685694278,"score_gpt":0.2660270959639948,"score_spread":0.197401349107052,"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."}}