{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001786039,0.001613562,0.001158644,0.001196984,0.0005970499,0.001749783,0.001347904,0.001343375,0.01085819],"category_scores_gemma":[0.002574943,0.0007430175,0.001372943,0.001068882,0.0008024934,0.001404331,0.001654423,0.003027245,0.002716369],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008209375,"about_ca_system_score_gemma":0.001893748,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001933389,"about_ca_topic_score_gemma":0.001324047,"domain_scores_codex":[0.9987049,0.00049256,0.00006460617,0.0001800196,0.0004459884,0.0001118255],"domain_scores_gemma":[0.9993621,0.0002765739,0.00005028117,0.000077841,0.0001937995,0.00003940928],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001173757,0.000112573,0.0004825132,0.0004351209,0.0001479428,0.0001220105,0.0001158257,0.46113,0.004025216,0.2760178,0.01759007,0.2397036],"study_design_scores_gemma":[0.00004482567,0.00005091125,0.0001045142,0.00006292021,0.0000309049,0.00009727018,0.0000259558,0.9178144,0.002303072,0.04938286,0.03005882,0.00002349489],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0008493969,0.0003380306,0.9900208,0.0001524088,0.000108995,0.00008525139,0.00007292397,0.0001504053,0.008221947],"genre_scores_gemma":[0.08145145,0.001867778,0.8971795,0.0003984136,0.0002578334,0.0005403769,0.0004792177,0.0002637832,0.0175616],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01085819,"threshold_uncertainty_score":0.0363242,"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."}}