{"id":"W2564296586","doi":"10.1287/ijoc.2016.0717","title":"Strengthened Benders Cuts for Stochastic Integer Programs with Continuous Recourse","year":2016,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":72,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Office of Naval Research; National Science Foundation","keywords":"Benders' decomposition; Mathematical optimization; Integer programming; Mathematics; Integer (computer science); Stochastic programming; Branch and cut; Linear programming relaxation; Relaxation (psychology); Variable (mathematics); Space (punctuation); Computer science","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":[],"consensus_categories":[],"category_scores_codex":[0.002219285,0.0001931736,0.0003119103,0.0003426977,0.0003557631,0.0005565677,0.0004693636,0.00007626394,0.00004483954],"category_scores_gemma":[0.001167632,0.00008524155,0.0001449623,0.0003570323,0.00008133838,0.0006293288,0.00004108002,0.0001998181,0.00005800392],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006894516,"about_ca_system_score_gemma":0.0001571095,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002466953,"about_ca_topic_score_gemma":0.000008106676,"domain_scores_codex":[0.9974859,0.00004104032,0.0008658684,0.0002444835,0.0009320393,0.0004306113],"domain_scores_gemma":[0.9966232,0.001166412,0.000931439,0.0002575463,0.0008028992,0.0002184595],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000262711,0.00003917342,0.002701692,8.534573e-7,0.00003289424,0.000007350828,0.000505271,0.02999073,0.000005492057,0.0004920739,0.001307016,0.9646547],"study_design_scores_gemma":[0.02882436,0.0182271,0.009023529,0.004089216,0.0002573404,0.003443774,0.01558317,0.6706538,0.0007470935,0.07322449,0.1723783,0.003547909],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2079021,0.00001537918,0.7891076,0.0006904445,0.0006853873,0.0002961631,0.000003515936,0.00004669116,0.001252663],"genre_scores_gemma":[0.9864484,0.00001378614,0.01199784,0.0002178629,0.0003639435,0.000004339383,0.000002379754,0.00002023705,0.0009311784],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9611068,"threshold_uncertainty_score":0.5366995,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06866419041123342,"score_gpt":0.3501395530223786,"score_spread":0.2814753626111453,"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."}}