{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004451369,0.0001273986,0.0001675535,0.0002526566,0.0003219963,0.0002564274,0.000219448,0.00003906543,0.00006845727],"category_scores_gemma":[0.0001416288,0.0001069274,0.00004505161,0.0004771899,0.00009710198,0.0003416211,0.00003536142,0.0005327381,0.00003209734],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007199153,"about_ca_system_score_gemma":0.00009902944,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.07366e-7,"about_ca_topic_score_gemma":8.944223e-8,"domain_scores_codex":[0.9975697,0.0006267221,0.0004879436,0.0001563749,0.0007944984,0.0003647596],"domain_scores_gemma":[0.9988511,0.0001464622,0.00005919771,0.0001221592,0.0006335093,0.0001876281],"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.0009580349,0.0003955868,0.003471246,0.0003891113,0.0005164685,0.0005210164,0.01978315,0.6990486,0.05442805,0.004013852,0.09185772,0.1246172],"study_design_scores_gemma":[0.00571689,0.005937508,0.02325446,0.002801283,0.00006113121,0.003246992,0.0008486776,0.5015382,0.004597917,0.0004910744,0.4500941,0.001411767],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2035321,0.005945098,0.7166539,0.000286194,0.000469178,0.0004425745,0.000001735878,0.0000954212,0.07257387],"genre_scores_gemma":[0.9760111,0.0001032947,0.0228204,0.00002703956,0.000733891,0.000002765478,0.000006368327,0.00005345058,0.0002416917],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7724791,"threshold_uncertainty_score":0.4360372,"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."}}