{"id":"W2522146534","doi":"10.1016/j.apm.2016.09.019","title":"Accelerated sample average approximation method for two-stage stochastic programming with binary first-stage variables","year":2016,"lang":"en","type":"article","venue":"Applied Mathematical Modelling","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":33,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Stochastic programming; Mathematical optimization; Binary number; Integer programming; Decomposition; Reduction (mathematics); Linear programming; Integer (computer science); Computer science; Decomposition method (queueing theory); Mathematics; Algorithm; Statistics","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009332664,0.0003832647,0.0004313278,0.0002390656,0.0003728203,0.0003731444,0.0003144311,0.00009121736,0.0005006064],"category_scores_gemma":[0.00009334324,0.0002581023,0.00009452793,0.0003634396,0.0000652423,0.0006810148,0.0001658191,0.0001091606,0.0001130016],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007699922,"about_ca_system_score_gemma":0.00001806087,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005426581,"about_ca_topic_score_gemma":0.000006879194,"domain_scores_codex":[0.9978404,0.00001098683,0.0005250731,0.0006049688,0.0003932695,0.0006253134],"domain_scores_gemma":[0.9984303,0.0006840298,0.0003002322,0.0004154796,0.0001278117,0.00004220666],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001664861,0.0002101688,0.000004088664,0.001226788,0.00007329467,0.000002245286,0.0001131851,0.269419,0.0004910211,0.7233972,0.00009002369,0.004806537],"study_design_scores_gemma":[0.001686967,0.00002565318,4.267805e-7,0.0002145238,0.000106114,4.94237e-7,0.0002414794,0.895165,0.0002220221,0.09373093,0.008192833,0.0004135781],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00270543,0.000008002939,0.9894719,0.0003142248,0.0000640273,0.002274503,0.00001235692,0.0003771159,0.004772495],"genre_scores_gemma":[0.4766568,0.000001668444,0.5199932,0.0004235364,0.0004167998,0.001417825,0.0000832337,0.0001259669,0.0008809192],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6296663,"threshold_uncertainty_score":0.9999871,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05610091761659942,"score_gpt":0.266886673498497,"score_spread":0.2107857558818976,"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."}}