{"id":"W2081655128","doi":"10.1080/00207543.2012.757668","title":"A branch-and-cut algorithm for the multi-product multi-vehicle inventory-routing problem","year":2013,"lang":"en","type":"article","venue":"International Journal of Production Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":158,"is_retracted":false,"has_abstract":true,"ca_institutions":"HEC Montréal","funders":"","keywords":"Vendor-managed inventory; Vehicle routing problem; Routing (electronic design automation); Product (mathematics); Inventory theory; Computer science; Vendor; Mathematical optimization; Inventory control; Operations research; Consistency (knowledge bases); Quality (philosophy); Supply chain; Supply chain management; Engineering; Mathematics; Business; Artificial intelligence; Marketing","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.001653557,0.001728855,0.001647963,0.001267018,0.001198257,0.001607598,0.002026023,0.0026398,0.007278782],"category_scores_gemma":[0.003414101,0.0009061819,0.001111643,0.002182186,0.0007466126,0.002041515,0.001688119,0.002761002,0.001398923],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001522947,"about_ca_system_score_gemma":0.002642635,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005637216,"about_ca_topic_score_gemma":0.005990469,"domain_scores_codex":[0.9991393,0.0002936471,0.00004528106,0.0001697523,0.0002334045,0.000118558],"domain_scores_gemma":[0.9987096,0.0008816446,0.0000885786,0.00005907526,0.0001834145,0.0000776586],"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.0001428562,0.0002465176,0.0006020506,0.0002520807,0.00006652418,0.0001647898,0.0001145111,0.7406746,0.001675545,0.03133506,0.009590763,0.2151347],"study_design_scores_gemma":[0.00005225485,0.0000526301,0.00007492168,0.00002131721,0.00001532805,0.00004904766,0.00002857748,0.9765269,0.000421249,0.02025058,0.002497812,0.000009439143],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003549151,0.0002429751,0.9926659,0.0002288617,0.00004558732,0.0001528542,0.0001030435,0.0002621414,0.002749479],"genre_scores_gemma":[0.0351973,0.0002506436,0.9618087,0.00009430759,0.00003841143,0.0003332936,0.0003268707,0.0001181728,0.001832315],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007278782,"threshold_uncertainty_score":0.02434993,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1067123934345328,"score_gpt":0.3979318811228896,"score_spread":0.2912194876883568,"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."}}