{"id":"W2110105948","doi":"10.1002/net.10009","title":"A comparative analysis of several formulations for the generalized minimum spanning tree problem","year":2001,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":55,"is_retracted":false,"has_abstract":true,"ca_institutions":"HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Minimum spanning tree; Polytope; Spanning tree; Heuristics; Combinatorics; Mathematics; Tree (set theory); Mathematical optimization; Computer science","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.0002818847,0.0001020071,0.0002763302,0.0001078971,0.0001033914,0.00002268639,0.0001133973,0.00006391295,0.00003273491],"category_scores_gemma":[0.00001420213,0.00008203496,0.0001479188,0.001001192,0.00002172799,0.00006417264,0.00001465644,0.00008699585,4.162356e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002772953,"about_ca_system_score_gemma":0.00000712227,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001028893,"about_ca_topic_score_gemma":0.0000699388,"domain_scores_codex":[0.9992989,0.00004545132,0.0002749654,0.0001024385,0.00008415726,0.0001940322],"domain_scores_gemma":[0.9991971,0.0004392307,0.00007050927,0.0001798748,0.00008286843,0.00003043801],"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.0000146789,0.000006979042,0.001714489,0.000004034709,0.0006213756,1.248847e-7,0.0006045973,0.9936115,0.00004133042,0.0004209543,0.0006436778,0.002316318],"study_design_scores_gemma":[0.000337079,0.00001142415,0.005938533,0.000007675941,0.0005003231,5.870894e-7,0.00004327123,0.9918122,0.0000263764,0.00006237414,0.001169634,0.00009054278],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02734657,0.0002476252,0.9701025,0.00005177044,0.00008391028,0.0002964166,0.000005641423,0.0001017589,0.001763778],"genre_scores_gemma":[0.7947508,0.00003051234,0.2048188,0.00002808499,0.00009388426,0.00005409006,0.00003876562,0.00001336114,0.0001717473],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7674042,"threshold_uncertainty_score":0.3345289,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03965971433503258,"score_gpt":0.310077445871883,"score_spread":0.2704177315368504,"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."}}