{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001277198,0.000655373,0.0009713966,0.0004772366,0.0006592802,0.0007414815,0.0009283902,0.0007041553,0.002066778],"category_scores_gemma":[0.00201997,0.0003205971,0.0006304988,0.0008574218,0.0005373412,0.000868527,0.0009492614,0.001259042,0.0002157218],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006016071,"about_ca_system_score_gemma":0.0009046721,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003422626,"about_ca_topic_score_gemma":0.003834461,"domain_scores_codex":[0.9992554,0.0003362287,0.00003042004,0.0001184438,0.0001951084,0.00006439788],"domain_scores_gemma":[0.9991955,0.0004563945,0.00007558364,0.00007584207,0.0001604233,0.00003621193],"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.0001294265,0.00008612199,0.0006457689,0.0001897017,0.00008292987,0.0001143459,0.000120721,0.8074643,0.00396089,0.05047622,0.001416404,0.1353132],"study_design_scores_gemma":[0.00000523694,0.00002269404,0.00006608522,0.000004365266,0.000004849988,0.00001054221,0.000003648861,0.9944003,0.0005159879,0.004427061,0.000534763,0.000004550922],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005131355,0.0001898404,0.9936523,0.00004718283,0.00003565431,0.00002300734,0.00000885287,0.00006110899,0.0008506098],"genre_scores_gemma":[0.3884014,0.0003379636,0.6066415,0.0001064047,0.00009130594,0.0002597584,0.00006307844,0.0000806181,0.004018021],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003422626,"threshold_uncertainty_score":0.006914079,"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."}}