{"id":"W2963427521","doi":"10.1016/j.ejor.2018.10.035","title":"Power transmission network expansion planning: A semidefinite programming branch-and-bound approach","year":2018,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Electric Power System Optimization","field":"Engineering","cited_by":43,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Semidefinite programming; Branch and bound; Mathematical optimization; Integer programming; Node (physics); Computer science; Linear programming relaxation; Relaxation (psychology); Transmission (telecommunications); Tree (set theory); Integer (computer science); Network planning and design; Upper and lower bounds; Search tree; Mathematics; Search algorithm","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00301406,0.002229701,0.003033245,0.001059461,0.0006863729,0.002623031,0.001890982,0.002078304,0.008073179],"category_scores_gemma":[0.005843796,0.00192226,0.001169301,0.001704823,0.001257072,0.002022677,0.001550515,0.003367741,0.001136286],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001251584,"about_ca_system_score_gemma":0.00252382,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00717373,"about_ca_topic_score_gemma":0.008103919,"domain_scores_codex":[0.9987412,0.0007627326,0.00003334244,0.0001276467,0.0002211683,0.0001139121],"domain_scores_gemma":[0.9966589,0.002574461,0.0001478649,0.0001216944,0.0003570966,0.0001398788],"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.00004266008,0.00005424813,0.00005975387,0.00005086516,0.00002254078,0.00002564588,0.00001806131,0.9801135,0.0001659743,0.00829592,0.001705756,0.00944509],"study_design_scores_gemma":[0.000007993473,0.00001024956,0.00001107999,0.000006519393,0.000004769317,0.000003368497,0.00000321603,0.9961564,0.00006104691,0.00353967,0.0001935341,0.00000209293],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00488642,0.0003040547,0.9851341,0.0003837612,0.00005601819,0.00007762875,0.0001303424,0.0002537554,0.008773841],"genre_scores_gemma":[0.4417343,0.001155674,0.5380897,0.0005108573,0.0002648686,0.0008632104,0.0007311743,0.0006821276,0.01596818],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008073179,"threshold_uncertainty_score":0.02700746,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04701012148451073,"score_gpt":0.3060157525761371,"score_spread":0.2590056310916263,"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."}}