{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0249152,0.0001147273,0.0001565444,0.0003152395,0.0004138282,0.0002324357,0.0005044133,0.00002601808,0.00009259545],"category_scores_gemma":[0.001369697,0.00008281819,0.00009550286,0.0004615056,0.0001018914,0.0001661212,0.00006693223,0.0006647834,0.00002928785],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001161805,"about_ca_system_score_gemma":0.0001591097,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001859495,"about_ca_topic_score_gemma":0.000002081611,"domain_scores_codex":[0.9969612,0.0008379927,0.0006430109,0.00012812,0.000970458,0.0004592155],"domain_scores_gemma":[0.9962199,0.002024217,0.00005985886,0.0001739667,0.001357379,0.0001647126],"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.0002449775,0.00004911649,0.0003793986,0.00006414871,0.0001443851,0.0001226084,0.001719065,0.9165468,0.02734089,0.002903483,0.01395516,0.03652996],"study_design_scores_gemma":[0.003320402,0.0006457283,0.01427745,0.0001912471,0.00003636322,0.0003319122,0.0009524938,0.9176417,0.007832399,0.0002030548,0.05421106,0.0003562062],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06373905,0.0008328063,0.9238486,0.001262215,0.0002691931,0.0004122791,0.000006251389,0.00003483729,0.009594807],"genre_scores_gemma":[0.7133923,0.0001048046,0.2837881,0.00006860446,0.001248719,0.000005143769,0.000005640291,0.00008292997,0.001303719],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6496533,"threshold_uncertainty_score":0.8635161,"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."}}