{"id":"W2075234757","doi":"10.1016/j.endm.2013.05.097","title":"Stronger Lower Bounds for the Quadratic Minimum Spanning Tree Problem with Adjacency Costs","year":2013,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal","funders":"Fundação de Amparo à Pesquisa do Estado de Minas Gerais; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Spanning tree; Mathematics; Minimum spanning tree; Adjacency list; Quadratic equation; Combinatorics; Minimum degree spanning tree; Column generation; Tree (set theory); Mathematical optimization; Linear programming; Upper and lower bounds; Discrete mathematics","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.007433916,0.00413595,0.003656998,0.004214433,0.002390477,0.006994254,0.0076345,0.004599281,0.03151201],"category_scores_gemma":[0.04786192,0.001951369,0.002827899,0.007346998,0.003374093,0.01749213,0.008026556,0.01331552,0.003443621],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004855638,"about_ca_system_score_gemma":0.002293412,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003211359,"about_ca_topic_score_gemma":0.004954994,"domain_scores_codex":[0.9934351,0.002033443,0.0002075894,0.001010754,0.002205774,0.001107221],"domain_scores_gemma":[0.9447246,0.04542485,0.002131142,0.002548579,0.003051366,0.002119631],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001027069,0.001019463,0.001639016,0.001991238,0.0002399389,0.0004562183,0.0007297641,0.2371734,0.006350273,0.5986794,0.06091473,0.08977956],"study_design_scores_gemma":[0.000109904,0.000173405,0.0008181093,0.0002062147,0.0001146067,0.0002667188,0.000166296,0.4408956,0.001012686,0.5481122,0.008067832,0.0000564455],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06441904,0.01258841,0.7894874,0.01713243,0.001753681,0.0002922787,0.002425551,0.0009873245,0.1109139],"genre_scores_gemma":[0.6615189,0.01199625,0.2589586,0.00725174,0.006628854,0.0009777825,0.005288479,0.002075962,0.04530344],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03151201,"threshold_uncertainty_score":0.1054182,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007557376348709966,"score_gpt":0.2212602827102928,"score_spread":0.2137029063615828,"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."}}