{"id":"W2935647296","doi":"10.1287/opre.2018.1835","title":"Robust Dual Dynamic Programming","year":2019,"lang":"en","type":"article","venue":"Operations Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":88,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"Engineering and Physical Sciences Research Council; Imperial College London","keywords":"Mathematical optimization; Bounding overwatch; Dynamic programming; Computer science; Scheme (mathematics); Dual (grammatical number); Stylized fact; Upper and lower bounds; Robust optimization; Embedding; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001452325,0.00119137,0.001034934,0.0007091971,0.0004498694,0.001754828,0.001289822,0.001372505,0.005147356],"category_scores_gemma":[0.002800641,0.0005931935,0.0009380915,0.0009728238,0.0008866768,0.001475831,0.001706299,0.002917567,0.001269476],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001195892,"about_ca_system_score_gemma":0.001014045,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009117502,"about_ca_topic_score_gemma":0.0006384407,"domain_scores_codex":[0.9990224,0.0003644443,0.00003543832,0.0002385084,0.0002485081,0.00009064393],"domain_scores_gemma":[0.9992381,0.0004019041,0.00007375771,0.00008799384,0.000155273,0.00004294506],"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.0001205576,0.00009888352,0.0002380028,0.0002671641,0.0001119043,0.00009855992,0.00005522751,0.4870814,0.002536097,0.3591729,0.01159986,0.1386193],"study_design_scores_gemma":[0.0000184141,0.00005085896,0.00005152565,0.00003151809,0.0000159476,0.00006107506,0.000009078517,0.9121299,0.001590856,0.06953093,0.01649335,0.00001658323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001402539,0.0005817672,0.9904816,0.0003664961,0.0001736245,0.00003591448,0.00005061287,0.0001055072,0.006801892],"genre_scores_gemma":[0.307094,0.002307381,0.6664128,0.00103286,0.0006415314,0.0004276374,0.0004013324,0.0003389046,0.0213435],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005147356,"threshold_uncertainty_score":0.01721966,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2675650150968807,"score_gpt":0.4947029442188555,"score_spread":0.2271379291219748,"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."}}