{"id":"W2134381195","doi":"10.1287/trsc.2013.0489","title":"A Branch-and-Price Algorithm for the Multidepot Vehicle Routing Problem with Interdepot Routes","year":2014,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":62,"is_retracted":false,"has_abstract":true,"ca_institutions":"HEC Montréal","funders":"","keywords":"Column generation; Vehicle routing problem; Mathematical optimization; Integer programming; Routing (electronic design automation); Branch and price; Shortest path problem; Computer science; Linear programming relaxation; Set (abstract data type); Relaxation (psychology); Branch and cut; Extension (predicate logic); Linear programming; Path (computing); Integer (computer science); Mathematics; Graph; Theoretical computer science","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.001083009,0.001216922,0.001248249,0.0009313245,0.0008756016,0.001338474,0.00158191,0.00160118,0.009493888],"category_scores_gemma":[0.002512362,0.0007297617,0.0009192305,0.001501744,0.0005890774,0.001792451,0.001159348,0.002231617,0.001579433],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001417803,"about_ca_system_score_gemma":0.002127115,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00602614,"about_ca_topic_score_gemma":0.007806712,"domain_scores_codex":[0.9993625,0.0002141716,0.00002762981,0.0001210532,0.0001479776,0.0001267118],"domain_scores_gemma":[0.9989123,0.0007450871,0.00007726374,0.00007767821,0.0001175886,0.00007011769],"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.0001535846,0.0002505423,0.000634169,0.0001769641,0.00005198668,0.0001204888,0.0001100704,0.7569944,0.002014375,0.0380303,0.01066791,0.1907952],"study_design_scores_gemma":[0.00005348944,0.00005242886,0.00008481774,0.00001008466,0.00000996151,0.00003633989,0.00002397069,0.9833676,0.0005331321,0.01364749,0.002172575,0.000008205187],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007567392,0.0002035504,0.987153,0.0002746155,0.0000474131,0.0001646364,0.0001321478,0.0004946046,0.003962667],"genre_scores_gemma":[0.0937363,0.0002678052,0.9018118,0.000149113,0.00004773198,0.0003292024,0.0005147049,0.0002205103,0.002922633],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009493888,"threshold_uncertainty_score":0.03176022,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01218817935459664,"score_gpt":0.2552692186820874,"score_spread":0.2430810393274907,"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."}}