{"id":"W1931616235","doi":"10.1287/opre.2015.1401","title":"Benders Decomposition for Production Routing Under Demand Uncertainty","year":2015,"lang":"en","type":"article","venue":"Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":214,"is_retracted":false,"has_abstract":true,"ca_institutions":"HEC Montréal","funders":"HEC Montréal; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Mathematical optimization; Production (economics); Routing (electronic design automation); Generalization; Branch and cut; Stochastic programming; Computer science; Pareto principle; Benders' decomposition; Upper and lower bounds; Exploit; Decomposition method (queueing theory); Decomposition; Time horizon; Mathematics; Linear programming; Economics","routes":{"ca_aff":true,"ca_fund":true,"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.002523881,0.00008183222,0.00008827205,0.0001888164,0.0004013841,0.0001502938,0.0001035144,0.00007124522,0.00001713825],"category_scores_gemma":[0.0006600243,0.00008568056,0.0000255311,0.0004707755,0.00005828504,0.0002648403,0.00002600348,0.0001998315,0.00002613125],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003290341,"about_ca_system_score_gemma":0.0001106096,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004203594,"about_ca_topic_score_gemma":0.000118057,"domain_scores_codex":[0.9987887,0.0002226903,0.0001902635,0.0002003662,0.0002983699,0.0002996728],"domain_scores_gemma":[0.9988875,0.0001212536,0.000006144708,0.000206045,0.0006695385,0.0001094907],"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.000007723458,0.00001516193,0.00005345544,0.00001353789,0.00001362035,1.557066e-7,0.0005959082,0.9890614,0.004706469,0.00220391,0.001947934,0.001380702],"study_design_scores_gemma":[0.0002925481,0.00003796629,0.00008591691,0.00001503056,0.000005127246,0.000004466906,0.001270547,0.9911736,0.005974706,0.0004792334,0.0005595519,0.0001013594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1363008,0.00006988941,0.8594272,0.001142014,0.0003255541,0.0006708321,0.000006243359,0.0002195908,0.001837844],"genre_scores_gemma":[0.8794162,0.0000132646,0.1194682,0.0000159291,0.0002327215,0.0001669108,0.00007651555,0.00003226972,0.000577968],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7431154,"threshold_uncertainty_score":0.3493952,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1613136766649102,"score_gpt":0.438498401075115,"score_spread":0.2771847244102048,"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."}}