{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007931559,0.00009871759,0.0001205308,0.0001018197,0.000121,0.00006256688,0.0001568298,0.00003919929,0.00003964113],"category_scores_gemma":[0.00004013601,0.0001040732,0.00003034239,0.0005425023,0.00007207724,0.0004892006,0.000002747906,0.00007218026,0.00001796638],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003492029,"about_ca_system_score_gemma":0.00003622198,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007279089,"about_ca_topic_score_gemma":0.00000362861,"domain_scores_codex":[0.9989992,0.000009507057,0.0002257983,0.0002534544,0.0002418965,0.000270131],"domain_scores_gemma":[0.9995153,0.0001117748,0.0000411796,0.000150334,0.0000979399,0.00008347368],"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.00001359412,0.00001779053,0.03494561,0.000179928,0.0000143743,9.000586e-7,0.004171239,0.7104816,0.1850652,0.005010577,0.00002795046,0.06007114],"study_design_scores_gemma":[0.0004877829,0.00002402347,0.1019395,0.00002325469,0.000008820417,9.835547e-7,0.0001015399,0.8708438,0.02579712,0.0002436206,0.0003371937,0.0001923601],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5613884,0.0000242705,0.4372772,0.00003775069,0.0002160571,0.0002109504,0.000008652578,0.0001936262,0.0006430741],"genre_scores_gemma":[0.9079348,0.00001068177,0.09184939,0.00004596908,0.00002504514,0.00001310382,0.000007002567,0.00001896354,0.00009502947],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3465464,"threshold_uncertainty_score":0.4243982,"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."}}