{"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":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.007987165,0.0001758486,0.0002399152,0.0003844678,0.002962124,0.001136879,0.0006156656,0.00009946652,0.00002837587],"category_scores_gemma":[0.001138767,0.0001053184,0.0000846818,0.001847325,0.0003440636,0.0004915522,0.00007400892,0.0003835204,0.0001293119],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001054233,"about_ca_system_score_gemma":0.0003226993,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001153431,"about_ca_topic_score_gemma":0.002305906,"domain_scores_codex":[0.9953335,0.001172597,0.0007092558,0.0006031299,0.001622975,0.0005585366],"domain_scores_gemma":[0.99224,0.003677642,0.0001024967,0.0006321989,0.003228223,0.000119478],"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.0003134541,0.000301793,0.0003564495,0.000003292334,0.00005166748,0.00000811123,0.0006734466,0.7675245,0.0009197649,0.01371468,0.003390893,0.2127419],"study_design_scores_gemma":[0.0008518202,0.000379553,0.002563617,0.00001625829,0.00001447791,0.00002498876,0.0006333853,0.9768262,0.00007952179,0.002113936,0.0163372,0.0001590659],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01004193,0.00009366897,0.9841197,0.002506054,0.0001386521,0.002491328,0.00009750867,0.00005652101,0.0004546896],"genre_scores_gemma":[0.1794915,0.00005064168,0.8032867,0.00003685166,0.000490272,0.001309643,0.0005876157,0.00005543011,0.01469138],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2125828,"threshold_uncertainty_score":0.9999,"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."}}