{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005623307,0.000143678,0.0001509335,0.00003975505,0.0001446894,0.00003975452,0.0001068538,0.00008561925,0.00001050621],"category_scores_gemma":[0.00002479196,0.000117631,0.00002998027,0.0001183727,0.00010482,0.0000748354,0.00004095413,0.0002449015,0.000001412752],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001918629,"about_ca_system_score_gemma":0.000008546754,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002626531,"about_ca_topic_score_gemma":0.00002335587,"domain_scores_codex":[0.9991605,0.00005645657,0.0001870013,0.0001821659,0.00007778017,0.0003361155],"domain_scores_gemma":[0.9993471,0.0003372348,0.00002393658,0.0001567617,0.00005369322,0.0000812766],"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.00002860792,0.00001041954,0.002302137,0.00005856248,0.00006810241,0.000002114971,0.001683944,0.786716,0.00009492628,0.0001078531,0.000493415,0.2084339],"study_design_scores_gemma":[0.0005929145,0.00002727783,0.005061332,0.00003807546,0.00002575904,0.00001429341,0.0001127991,0.9931647,0.0005318183,0.00004287986,0.000242329,0.000145829],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02960007,0.0007252161,0.9684788,0.0000394695,0.0001563069,0.000368251,0.000006387795,0.0001766203,0.0004488878],"genre_scores_gemma":[0.8297482,0.00008478735,0.1698157,0.00004314291,0.00009946162,0.00003983276,0.000005469742,0.00004875326,0.0001147092],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8001481,"threshold_uncertainty_score":0.4796853,"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."}}