{"id":"W3010739339","doi":"10.1287/opre.2019.1892","title":"The Benders Dual Decomposition Method","year":2020,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":77,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal; Université du Québec à Montréal","funders":"","keywords":"Benders' decomposition; Mathematical optimization; Benchmark (surveying); Decomposition; Dual (grammatical number); Decomposition method (queueing theory); Exploit; Integer programming; Integer (computer science); Computer science; Node (physics); Mathematics; Algorithm; Engineering","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":["sts"],"consensus_categories":[],"category_scores_codex":[0.001917319,0.00009480476,0.0001123003,0.000102623,0.001873685,0.0003946575,0.0003492363,0.00006138848,0.0004227235],"category_scores_gemma":[0.003754456,0.0000694077,0.00004621831,0.001004901,0.0001798862,0.0002526306,0.0002205773,0.0006270118,0.00030495],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001089417,"about_ca_system_score_gemma":0.0002171538,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002084672,"about_ca_topic_score_gemma":0.0000918602,"domain_scores_codex":[0.9970662,0.0009136587,0.0002682405,0.0002931269,0.00100992,0.0004488637],"domain_scores_gemma":[0.9967252,0.00182256,0.00001387196,0.0003562278,0.0008647038,0.0002174125],"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.0001391044,0.0002316998,0.00002136486,0.00005856635,0.0001266828,0.00003558447,0.004662341,0.1215586,0.01035461,0.7445323,0.06459861,0.05368051],"study_design_scores_gemma":[0.0004597894,0.000149093,0.00001751729,0.0000082908,0.000005443528,0.00001140791,0.002331761,0.9522358,0.005059614,0.01610908,0.02346638,0.0001457815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001086716,0.00008704791,0.9475144,0.04189381,0.0000489226,0.0008611252,0.00001527664,0.0001066504,0.008386078],"genre_scores_gemma":[0.04576785,0.0002436712,0.9461685,0.0003410425,0.0003877156,0.0003805606,0.00004473569,0.00006935805,0.006596521],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8306773,"threshold_uncertainty_score":0.9994258,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.3165010738985468,"score_gpt":0.5717275746829251,"score_spread":0.2552265007843783,"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."}}