{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001551005,0.00008313928,0.0000818292,0.00006599062,0.0001799866,0.00007186536,0.0001941904,0.00002785454,0.000004372064],"category_scores_gemma":[0.00006691457,0.00006704798,0.00002245126,0.000572955,0.0001506016,0.0003300714,0.000003287098,0.00007045136,0.000003192725],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004066608,"about_ca_system_score_gemma":0.00007661812,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001379469,"about_ca_topic_score_gemma":0.00001178941,"domain_scores_codex":[0.9991134,0.0000127147,0.0002032779,0.0001722531,0.0002812238,0.0002171628],"domain_scores_gemma":[0.9994648,0.00009611018,0.00004162493,0.0001255482,0.0001651586,0.0001067806],"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.000006618925,0.00001597864,0.004206785,0.00006220444,0.00001951975,9.763939e-7,0.01579253,0.6754132,0.00321185,0.005857509,0.0002354219,0.2951774],"study_design_scores_gemma":[0.0003388827,0.00001455886,0.004133115,0.00001286429,0.00001354683,0.000001514479,0.0002679592,0.991372,0.001910071,0.0007523007,0.001073106,0.0001100482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02454681,0.0001007085,0.9740245,0.0001389152,0.0002145418,0.0003017112,0.000007408256,0.0001986339,0.0004667279],"genre_scores_gemma":[0.6549415,0.0000132234,0.3448056,0.00006546065,0.000043739,0.00004826787,0.000004095212,0.00001605421,0.00006208447],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6303947,"threshold_uncertainty_score":0.2734137,"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."}}