{"id":"W2120195113","doi":"10.5539/mas.v2n5p122","title":"Adaptive Multicut Aggregation Method for Solving Two-stage Stochastic Convex Programming with Recourse","year":2008,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Mathematical optimization; Computer science; Convergence (economics); Regular polygon; Simple (philosophy); Computation; Stochastic programming; Rate of convergence; Convex optimization; Stage (stratigraphy); Mathematics; Algorithm; Key (lock); Biology","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":[],"consensus_categories":[],"category_scores_codex":[0.003836181,0.0002146885,0.0003134634,0.000408616,0.001213844,0.000312827,0.0007786666,0.00005901706,0.000019192],"category_scores_gemma":[0.0006786122,0.0001560218,0.00005894897,0.001556319,0.0007255029,0.0007429151,0.00009481336,0.0001392527,0.00003346101],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009361963,"about_ca_system_score_gemma":0.0004788138,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004524199,"about_ca_topic_score_gemma":0.00005357027,"domain_scores_codex":[0.9961256,0.00004041446,0.0004896616,0.001012376,0.001762064,0.0005698344],"domain_scores_gemma":[0.9972399,0.0007889217,0.0004636768,0.0005536898,0.0007350256,0.0002188003],"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.0002621038,0.00007889653,0.0002635293,0.000002497173,0.000008950353,0.000005869778,0.006776216,0.501283,0.01165542,0.00352314,0.000072649,0.4760677],"study_design_scores_gemma":[0.0007800767,0.000104624,0.0002013926,0.00001144821,0.00001328458,0.00001953183,0.000943023,0.989235,0.003151822,0.005005643,0.0002891165,0.000245066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02182868,0.00002629186,0.9753726,0.00008888535,0.0001390148,0.001164793,0.000008957205,0.0000910696,0.001279731],"genre_scores_gemma":[0.6161489,0.000004108934,0.3830522,0.00006244584,0.00004012752,0.0001328439,0.000002836311,0.00001357031,0.0005429442],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5943202,"threshold_uncertainty_score":0.933603,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1040960414836613,"score_gpt":0.3829672516428794,"score_spread":0.278871210159218,"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."}}