{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004062732,0.0001227113,0.0001523885,0.0003513724,0.0002119759,0.000242023,0.0004839795,0.00005410352,0.00005536144],"category_scores_gemma":[0.001528982,0.00009402238,0.00008357997,0.0002894161,0.0001342778,0.0005268847,0.0000931691,0.0006000721,0.00001884772],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001850169,"about_ca_system_score_gemma":0.00006903446,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005241289,"about_ca_topic_score_gemma":0.000006886677,"domain_scores_codex":[0.9979886,0.0002110486,0.000528694,0.0002164295,0.0007546149,0.0003005472],"domain_scores_gemma":[0.9965322,0.0002929757,0.0001501808,0.0001729237,0.002755422,0.00009631037],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003514284,0.0001872689,0.002655011,0.00007623834,0.0005155781,0.000004451352,0.001949419,0.1035661,0.04875673,0.0002048845,0.006648661,0.8354005],"study_design_scores_gemma":[0.001067184,0.00005645753,0.00275534,0.00009728876,0.00001601171,0.0001491558,0.0004604464,0.968047,0.02217713,0.0004064245,0.004621775,0.0001457635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06295583,0.001308097,0.9205338,0.01048737,0.003279973,0.001242263,0.000007382252,0.0001063384,0.00007894874],"genre_scores_gemma":[0.5171283,0.0004121255,0.4784528,0.00004648672,0.002398331,0.0001167902,0.000003215509,0.00006191462,0.001380061],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8644809,"threshold_uncertainty_score":0.3834121,"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."}}