{"id":"W4388282681","doi":"10.1016/j.cor.2023.106459","title":"An asynchronous parallel benders decomposition method for stochastic network design problems","year":2023,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":9,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal; Université du Québec à Montréal","funders":"","keywords":"Asynchronous communication; Computer science; Benchmark (surveying); Benders' decomposition; Mathematical optimization; Synchronization (alternating current); Decomposition; Parallel computing; Disjoint sets; Integer (computer science); Parallel algorithm; Acceleration; Algorithm; 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":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.01180577,0.0001611169,0.0002608483,0.0008559383,0.001736314,0.001343968,0.0009276517,0.0001188497,0.0000596776],"category_scores_gemma":[0.000605945,0.0001381676,0.00009488734,0.003071777,0.0001125751,0.0006859943,0.0001386369,0.0002419971,0.0003366367],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001013729,"about_ca_system_score_gemma":0.000361838,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000794518,"about_ca_topic_score_gemma":0.0001256514,"domain_scores_codex":[0.9949397,0.001689921,0.0006112789,0.0007444239,0.001307076,0.0007075538],"domain_scores_gemma":[0.9942365,0.003434055,0.00005301372,0.0007172283,0.00130887,0.0002503802],"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.00003744799,0.00005399553,0.00002490425,0.000002056908,0.00001615309,0.000002206852,0.0007891833,0.9042349,0.0001375515,0.003413781,0.03591937,0.05536843],"study_design_scores_gemma":[0.0004138874,0.0004405022,0.0003793367,0.00001543116,0.000006845544,0.000006602108,0.0002722125,0.9793699,0.00002809134,0.01753035,0.001377507,0.0001592846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001341197,0.00006943497,0.9946017,0.001393333,0.0004602978,0.001871034,0.00001418538,0.0001573377,0.00009152175],"genre_scores_gemma":[0.146233,0.00008606812,0.8516816,0.0001202459,0.0004699863,0.0005979302,0.0002993476,0.00003517546,0.0004766553],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1448918,"threshold_uncertainty_score":0.9996927,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.3054584264508511,"score_gpt":0.5291444966876263,"score_spread":0.2236860702367752,"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."}}