{"id":"W2017602820","doi":"10.1016/j.ejor.2007.08.021","title":"A tabu search heuristic for the generalized minimum spanning tree problem","year":2007,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":39,"is_retracted":false,"has_abstract":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Tabu search; Minimum spanning tree; Guided Local Search; Mathematical optimization; Heuristic; Spanning tree; Beam search; Mathematics; Vertex (graph theory); k-minimum spanning tree; Tree (set theory); Kruskal's algorithm; Set (abstract data type); Computer science; Graph; Algorithm; Search algorithm; Combinatorics; Tree structure; K-ary tree; Binary tree","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.000965267,0.0006404518,0.001011905,0.001158539,0.0008596629,0.0009282221,0.001478945,0.001675753,0.007892832],"category_scores_gemma":[0.003768626,0.0005317793,0.0007068043,0.002025914,0.0007114209,0.001072264,0.000827775,0.0008531038,0.0008974292],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008885933,"about_ca_system_score_gemma":0.001349155,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006464592,"about_ca_topic_score_gemma":0.006208031,"domain_scores_codex":[0.9994929,0.0002842981,0.00001514461,0.00005065231,0.00008499897,0.00007212084],"domain_scores_gemma":[0.9988909,0.0007446876,0.00006889261,0.00009165357,0.0001572795,0.00004644919],"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.0001936353,0.0001167019,0.0004177372,0.0001391513,0.00005600001,0.00008122196,0.0001103144,0.7957326,0.001346194,0.01122931,0.006805682,0.1837715],"study_design_scores_gemma":[0.00006678626,0.00006012778,0.0001435229,0.00002289075,0.00002102652,0.00003115651,0.00003552096,0.9909135,0.0003355146,0.006614619,0.001745258,0.00001004532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09411089,0.002092389,0.8858333,0.0006436766,0.0003716803,0.0003204433,0.0003910284,0.001987304,0.01424925],"genre_scores_gemma":[0.2915547,0.0005132263,0.7022576,0.0002482497,0.00008279438,0.0003338371,0.0004599019,0.0003613224,0.004188317],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007892832,"threshold_uncertainty_score":0.02640408,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1187887509119475,"score_gpt":0.3928427993228669,"score_spread":0.2740540484109195,"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."}}