{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001873353,0.001830127,0.001836751,0.00110741,0.0008880317,0.002004561,0.002372858,0.001802851,0.008194085],"category_scores_gemma":[0.006192899,0.0007690804,0.001610719,0.002366938,0.000978626,0.003308398,0.002114671,0.004451518,0.001216744],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001811295,"about_ca_system_score_gemma":0.003362881,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004845348,"about_ca_topic_score_gemma":0.005360178,"domain_scores_codex":[0.9984165,0.0005567747,0.00006842189,0.0002849167,0.0003939132,0.0002794214],"domain_scores_gemma":[0.9982499,0.001075177,0.0001721787,0.0001679501,0.000188797,0.0001458611],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002433751,0.000479524,0.0006163049,0.0003669777,0.00008313767,0.0001360104,0.0001933569,0.6924917,0.001247373,0.1228186,0.01356805,0.1677556],"study_design_scores_gemma":[0.00004567419,0.00006484018,0.0001155464,0.00001835041,0.00001520571,0.00003642756,0.00002844537,0.95798,0.0003368104,0.03946965,0.00187885,0.00001013193],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01817067,0.0009757949,0.9680449,0.0007050646,0.0001218655,0.0002071555,0.0001944458,0.0004986775,0.01108142],"genre_scores_gemma":[0.2242756,0.001066194,0.7642615,0.0004239433,0.0001959932,0.0006756249,0.001093661,0.0003918932,0.007615593],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008194085,"threshold_uncertainty_score":0.02741194,"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."}}