{"id":"W1669838345","doi":"","title":"The Abridged Nested Decomposition Method for Multistage Stochastic Linear Programs with Relatively Complete Recourse","year":2006,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":86,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Decomposition; Computation; Set (abstract data type); Mathematical optimization; Computer science; Scale (ratio); Sampling (signal processing); Nested set model; Multistage sampling; Decomposition method (queueing theory); Mathematics; Algorithm; Statistics; Data mining","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002158781,0.0006985718,0.0007850455,0.0003977066,0.0002902962,0.000505459,0.0008741952,0.0005412189,0.002872184],"category_scores_gemma":[0.004079651,0.0004480816,0.0008387758,0.0005067668,0.0006617123,0.0009610815,0.001082639,0.001366065,0.0004888931],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004594515,"about_ca_system_score_gemma":0.001310693,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002773767,"about_ca_topic_score_gemma":0.003948408,"domain_scores_codex":[0.9989812,0.0005532753,0.00002575241,0.00008050205,0.0002972335,0.00006202613],"domain_scores_gemma":[0.998971,0.0006303921,0.00008550715,0.000102919,0.0001282062,0.00008195068],"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.00009604775,0.0001194804,0.000490632,0.00023373,0.00007395146,0.0001570808,0.0001138727,0.6753643,0.008319509,0.2103276,0.002240689,0.1024632],"study_design_scores_gemma":[0.00001104711,0.00003186322,0.00006940206,0.0000108322,0.000006284449,0.00002192834,0.000003971249,0.9731362,0.0005398477,0.02413219,0.002029869,0.000006706747],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001435597,0.00007036814,0.9978306,0.00001997344,0.00001343411,0.00001694343,0.00001278478,0.00003301248,0.0005674337],"genre_scores_gemma":[0.1046052,0.0002680879,0.8919675,0.00005946794,0.00004437235,0.0002101619,0.00009444225,0.00009580845,0.002655029],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002872184,"threshold_uncertainty_score":0.01141685,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1881139073848471,"score_gpt":0.5090869338795994,"score_spread":0.3209730264947522,"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."}}