{"id":"W1971036791","doi":"10.1002/net.21580","title":"Branch‐and‐cut and Branch‐and‐cut‐and‐price algorithms for the adjacent only quadratic minimum spanning tree problem","year":2015,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"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; Branch and cut; Maximum cut; Mathematics; Minimum spanning tree; Linear programming relaxation; Integer programming; Linear programming; Linearization; Branch and bound; Cutting-plane method; Quadratic equation; Combinatorics; Relaxation (psychology); Branch and price; Mathematical optimization; Algorithm; Graph; Nonlinear system","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.0009944804,0.000279372,0.0003345717,0.0000578592,0.0002022881,0.0001768529,0.0001246825,0.0001899586,0.000004100369],"category_scores_gemma":[0.0001184577,0.0002312987,0.00003851625,0.0002033672,0.00009651738,0.0001676517,0.00009919971,0.000314915,0.00000116114],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003985489,"about_ca_system_score_gemma":0.00003008375,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002033331,"about_ca_topic_score_gemma":0.00004828378,"domain_scores_codex":[0.9985942,0.00009825999,0.0003466239,0.0003391014,0.0001685052,0.0004533688],"domain_scores_gemma":[0.9986498,0.0007205426,0.00008300285,0.0002410785,0.00007699999,0.0002285408],"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.00006033925,0.00002256613,0.005475278,0.0002470031,0.000165621,0.000003006453,0.003413539,0.5613912,0.00007273372,0.0004503326,0.002467928,0.4262305],"study_design_scores_gemma":[0.001295886,0.0000808118,0.003096287,0.0001178631,0.0000913515,0.0000480818,0.0001634276,0.9905593,0.00003109436,0.0003731746,0.003850709,0.0002920193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04529753,0.01244949,0.9391783,0.0006860677,0.0004944864,0.0008325143,0.000005849492,0.0002869427,0.0007688603],"genre_scores_gemma":[0.8676825,0.001381456,0.1292268,0.0003162612,0.0007571138,0.000113047,0.00001324513,0.0001308199,0.0003787544],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.822385,"threshold_uncertainty_score":0.9432086,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02871880323920883,"score_gpt":0.266627552590149,"score_spread":0.2379087493509401,"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."}}