{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002265793,0.001930931,0.001356718,0.001175093,0.0006082637,0.001376141,0.0008932294,0.001395614,0.006392753],"category_scores_gemma":[0.003009845,0.001169304,0.001861637,0.001479238,0.0008138248,0.001696589,0.001027001,0.002549846,0.000892357],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002025997,"about_ca_system_score_gemma":0.001975378,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006031306,"about_ca_topic_score_gemma":0.004931083,"domain_scores_codex":[0.9989624,0.0004294187,0.00004976242,0.0001640017,0.000263203,0.0001312322],"domain_scores_gemma":[0.9990906,0.0005818841,0.0001016009,0.00006427872,0.000116789,0.00004481429],"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.00002796105,0.00001942847,0.0001008931,0.00004176153,0.00001923682,0.00003070523,0.00002355446,0.9556358,0.0006164527,0.03305636,0.0006575129,0.009770336],"study_design_scores_gemma":[0.000008468112,0.00001103428,0.00003710032,0.00000743698,0.000005711219,0.000006939462,0.0000071821,0.9670969,0.0001825945,0.03168423,0.0009482674,0.000004232855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004332566,0.0001924493,0.9919094,0.000136939,0.00002464439,0.00005166758,0.0001333462,0.0001151867,0.003103741],"genre_scores_gemma":[0.2134541,0.001417666,0.7696562,0.0002086123,0.0001499452,0.0006692701,0.001208276,0.0003319242,0.01290402],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006392753,"threshold_uncertainty_score":0.02138585,"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."}}