{"id":"W4390079318","doi":"10.1016/j.ejor.2023.12.021","title":"Leveraging decision diagrams to solve two-stage stochastic programs with binary recourse and logical linking constraints","year":2023,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Binary decision diagram; Computer science; Mathematical optimization; Binary number; Stochastic programming; Stage (stratigraphy); Set (abstract data type); Class (philosophy); Mathematics; Algorithm; Artificial intelligence; Programming language","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.003054234,0.001170938,0.001129522,0.001488656,0.0005307905,0.001933982,0.0009218995,0.001376123,0.00536792],"category_scores_gemma":[0.01097842,0.0009240813,0.001658468,0.001043511,0.0008105599,0.001803276,0.001679629,0.001715499,0.0005060027],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008235191,"about_ca_system_score_gemma":0.001885935,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005789178,"about_ca_topic_score_gemma":0.007755151,"domain_scores_codex":[0.9983556,0.0009062038,0.00009616466,0.000163193,0.0003516675,0.0001271113],"domain_scores_gemma":[0.992633,0.00613452,0.0003172522,0.0001981368,0.0005305654,0.0001864836],"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.00006730133,0.00007704407,0.0005152106,0.0001158718,0.00004424636,0.0001023432,0.00007436929,0.9325244,0.001115845,0.03335343,0.0003932586,0.03161681],"study_design_scores_gemma":[0.00001211613,0.00001742823,0.00002844572,0.00001343367,0.00001018417,0.000009584682,0.000006380484,0.9801051,0.0002982071,0.01892891,0.0005649546,0.000005112533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009005292,0.00008470166,0.9891059,0.00007079121,0.00002844042,0.00005351297,0.00006739854,0.0002551965,0.00132867],"genre_scores_gemma":[0.3371319,0.000242299,0.6597709,0.00007510613,0.0000232346,0.0002645771,0.0003089756,0.0001814919,0.002001628],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005789178,"threshold_uncertainty_score":0.01795745,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2940158166439834,"score_gpt":0.46408445923682,"score_spread":0.1700686425928366,"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."}}