{"id":"W2065616449","doi":"10.1109/icadlt.2013.6568518","title":"Stochastic dual dynamic programming for transportation planning under demand uncertainty","year":2013,"lang":"en","type":"article","venue":"","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Context (archaeology); Procurement; Stochastic programming; Time horizon; Operations research; Set (abstract data type); Dual (grammatical number); Core (optical fiber); Dynamic programming; Mathematical optimization; Process (computing); Linear programming; Engineering; Mathematics; Economics","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.002823122,0.001509209,0.001889486,0.001007595,0.0005498915,0.002110241,0.001203002,0.001549246,0.003312936],"category_scores_gemma":[0.004507682,0.001054376,0.001103528,0.001764292,0.001491349,0.001460095,0.001607738,0.002415115,0.0003553644],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002836162,"about_ca_system_score_gemma":0.00268609,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0101604,"about_ca_topic_score_gemma":0.00667126,"domain_scores_codex":[0.998262,0.001038165,0.00004745369,0.0001762885,0.0002863574,0.0001897188],"domain_scores_gemma":[0.9971878,0.002250387,0.0002047341,0.00005233504,0.0002041599,0.0001007189],"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.00002719717,0.00001629811,0.000094242,0.00004331357,0.00002065603,0.00002913454,0.00001774511,0.9677473,0.000124452,0.02876077,0.00033944,0.002779366],"study_design_scores_gemma":[0.000005812228,0.0000108741,0.00003168581,0.000005054015,0.00000349792,0.000004122863,0.000006476234,0.9865692,0.00003899911,0.01296838,0.0003515192,0.000004490811],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01050042,0.0009054391,0.981158,0.0005548892,0.00008600297,0.00005631119,0.0001882277,0.0001004577,0.006450352],"genre_scores_gemma":[0.816804,0.002438922,0.1670722,0.0002846673,0.0002400468,0.0005952087,0.0006272452,0.0001776962,0.01176003],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0101604,"threshold_uncertainty_score":0.02057791,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02127054795016311,"score_gpt":0.2461947331799008,"score_spread":0.2249241852297377,"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."}}