{"id":"W1832376799","doi":"10.1287/trsc.2015.0635","title":"A Branch-Price-and-Cut Algorithm for the Inventory-Routing Problem","year":2015,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":134,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université Laval; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Column generation; Branch and cut; Benchmark (surveying); Routing (electronic design automation); Mathematical optimization; Branch and price; Computer science; Vehicle routing problem; Set (abstract data type); State (computer science); Algorithm; Operations research; Integer programming; Mathematics","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.001247102,0.001704405,0.001388446,0.001155065,0.0009543174,0.001423376,0.001956524,0.002112902,0.007805705],"category_scores_gemma":[0.00380315,0.0007452484,0.0009831566,0.002189209,0.0005227528,0.001735784,0.001080066,0.002839974,0.001301063],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001753354,"about_ca_system_score_gemma":0.003156814,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005548859,"about_ca_topic_score_gemma":0.006791743,"domain_scores_codex":[0.999173,0.000255686,0.00004220898,0.0001866074,0.0002178954,0.0001246238],"domain_scores_gemma":[0.9987195,0.000817218,0.00009471821,0.00009659759,0.0002002668,0.00007178736],"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.0001866982,0.0003602666,0.0005529306,0.0002248649,0.0000758735,0.0001303695,0.00007362893,0.6852326,0.001615462,0.02845012,0.01707757,0.2660196],"study_design_scores_gemma":[0.00008008185,0.00007414402,0.00009213523,0.00001543725,0.00002033673,0.00005541434,0.00001811954,0.9819698,0.0008062693,0.01368684,0.003171355,0.00001007739],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009425824,0.0003498905,0.9821776,0.0004187344,0.0001047798,0.0003235977,0.0003188324,0.0007195848,0.006161251],"genre_scores_gemma":[0.06616209,0.0003178904,0.9282212,0.0001969006,0.000061314,0.0005361506,0.0009737517,0.0002163153,0.003314373],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007805705,"threshold_uncertainty_score":0.02611268,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0419161086913205,"score_gpt":0.2980385804930498,"score_spread":0.2561224718017293,"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."}}