{"id":"W2889549077","doi":"10.1287/trsc.2018.0878","title":"Exact Branch-Price-and-Cut Algorithms for Vehicle Routing","year":2019,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université du Québec à Montréal; Polytechnique Montréal; Université de Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Vehicle routing problem; Computer science; Algorithm; Branch and cut; Routing (electronic design automation); Integer programming; Computer network","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.002458816,0.002078152,0.002296769,0.001267488,0.0008374374,0.002471463,0.002505414,0.002265655,0.006997043],"category_scores_gemma":[0.00834533,0.0009358133,0.0013742,0.004397824,0.001217194,0.00340657,0.001742859,0.003678224,0.001978293],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001787962,"about_ca_system_score_gemma":0.002418322,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0040573,"about_ca_topic_score_gemma":0.003925157,"domain_scores_codex":[0.9976044,0.0008134281,0.0001322372,0.0003808412,0.0008396005,0.000229481],"domain_scores_gemma":[0.9968814,0.002223354,0.0002053655,0.0002580559,0.0003621163,0.00006978945],"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.00005581557,0.00009790465,0.00030671,0.0004160576,0.0000818895,0.00004217389,0.00006281368,0.6856169,0.00039649,0.1120356,0.00828944,0.1925982],"study_design_scores_gemma":[0.000027099,0.00003360288,0.00009767255,0.00006259078,0.00002302239,0.00004468425,0.00002025403,0.847065,0.0003161505,0.1449711,0.007327132,0.00001163501],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001868148,0.003847905,0.9885273,0.0002730569,0.0001216241,0.00005809023,0.0001170184,0.0001876138,0.004999298],"genre_scores_gemma":[0.1237461,0.01167016,0.8549497,0.0003468471,0.000434344,0.000423279,0.0009194146,0.0003594758,0.007150725],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006997043,"threshold_uncertainty_score":0.02340746,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02195845300478895,"score_gpt":0.2910243843325513,"score_spread":0.2690659313277624,"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."}}