{"id":"W1967987311","doi":"10.1016/j.cor.2010.01.004","title":"The quadratic minimum spanning tree problem: A lower bounding procedure and an efficient search algorithm","year":2010,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":43,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Galatasaray Üniversitesi","keywords":"Bounding overwatch; Minimum spanning tree; Tabu search; Spanning tree; Mathematics; Quadratic equation; k-minimum spanning tree; Heuristic; Mathematical optimization; Euclidean minimum spanning tree; Relaxation (psychology); Distributed minimum spanning tree; Local search (optimization); Algorithm; Kruskal's algorithm; Combinatorics; Computer science; Tree structure; Binary tree; Artificial intelligence","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":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.003257831,0.0001662073,0.0001478937,0.0002752397,0.001737316,0.001371283,0.0004317598,0.0001076332,0.00001434065],"category_scores_gemma":[0.0002099406,0.0001356411,0.00002985284,0.0007865516,0.0002871229,0.000225906,0.0001817072,0.001044938,0.00001963716],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007954199,"about_ca_system_score_gemma":0.0001743197,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002798342,"about_ca_topic_score_gemma":0.0001553344,"domain_scores_codex":[0.9977743,0.000370332,0.0003057927,0.0003594447,0.0005611498,0.0006289852],"domain_scores_gemma":[0.9984013,0.0004858019,0.00001024264,0.0004699593,0.0004051709,0.0002275129],"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.000005479875,0.0000629436,0.000111749,0.00005012823,0.0000263504,0.000009282191,0.003574192,0.9156355,0.009653236,0.001594171,0.0004433566,0.06883357],"study_design_scores_gemma":[0.0002364388,0.00008543536,0.0003346541,0.00003966367,0.000004088704,0.00003080897,0.0004153837,0.9974689,0.0006518,0.00003534966,0.0005393255,0.0001581006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4614523,0.0001403681,0.5354475,0.0008331046,0.0004904706,0.0008238208,0.000003325977,0.0002487651,0.0005603554],"genre_scores_gemma":[0.5878951,0.00002229507,0.4113939,0.0000165099,0.0002715132,0.00009715166,0.00001032621,0.00005140859,0.0002418271],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.1264428,"threshold_uncertainty_score":0.9996654,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0356672783289809,"score_gpt":0.3615242661527958,"score_spread":0.3258569878238148,"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."}}