{"id":"W2136871443","doi":"10.1287/trsc.1060.0188","title":"A Branch-and-Cut Algorithm for a Vendor-Managed Inventory-Routing Problem","year":2007,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":426,"is_retracted":false,"has_abstract":true,"ca_institutions":"HEC Montréal","funders":"","keywords":"Mathematical optimization; Stockout; Integer programming; Operations research; Vendor; Time horizon; Purchasing; Computer science; Economic order quantity; Linear programming; Set (abstract data type); Order (exchange); Vendor-managed inventory; Routing (electronic design automation); Branch and cut; Supply chain; Vehicle routing problem; Product (mathematics); Supply chain management; Mathematics; Operations management; Economics; Business","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.001891517,0.00168344,0.001747279,0.001127562,0.000991624,0.001735632,0.001971448,0.002599655,0.008339256],"category_scores_gemma":[0.003250452,0.001063727,0.0009267543,0.001965107,0.0006985285,0.001658119,0.001230264,0.002068748,0.0009955794],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001762416,"about_ca_system_score_gemma":0.002573722,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007885685,"about_ca_topic_score_gemma":0.007389176,"domain_scores_codex":[0.999122,0.0003877978,0.00003679685,0.0001567609,0.000154304,0.0001423066],"domain_scores_gemma":[0.9983143,0.001278874,0.0001048727,0.00005510407,0.0001551296,0.00009177773],"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.000123158,0.0001779967,0.0003482532,0.0001233005,0.00003797553,0.00009222465,0.00006567124,0.9254643,0.0005134252,0.01371935,0.003501456,0.05583303],"study_design_scores_gemma":[0.00005681417,0.00003284253,0.00004194819,0.00001019554,0.000008926593,0.00001517682,0.00001755482,0.9910942,0.0001617004,0.007711772,0.000844285,0.000004549277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01940219,0.0003985747,0.9725762,0.0005686253,0.00005288899,0.0002767355,0.000358078,0.0005573193,0.005809417],"genre_scores_gemma":[0.1158651,0.0003608709,0.8791915,0.0001482287,0.00004697202,0.000544472,0.0007874909,0.0001582129,0.002897108],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008339256,"threshold_uncertainty_score":0.0278976,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02032142200990912,"score_gpt":0.2890078836574357,"score_spread":0.2686864616475266,"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."}}