{"id":"W3020867067","doi":"10.1287/opre.2020.2033","title":"Asymmetric Multidepot Vehicle Routing Problems: Valid Inequalities and a Branch-and-Cut Algorithm","year":2021,"lang":"en","type":"article","venue":"Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Branch and cut; Routing (electronic design automation); Vehicle routing problem; Solver; Reduction (mathematics); Mathematical optimization; Path (computing); Computer science; Mathematics; Node (physics); Inequality; Upper and lower bounds; Algorithm; Integer programming","routes":{"ca_aff":true,"ca_fund":true,"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.002418407,0.001965586,0.0011642,0.001000925,0.0006732817,0.001935724,0.0030662,0.00180523,0.00405727],"category_scores_gemma":[0.004760917,0.0009568667,0.001180799,0.002250156,0.001159546,0.003162258,0.00197806,0.004638934,0.000649619],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001740115,"about_ca_system_score_gemma":0.001759029,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002898825,"about_ca_topic_score_gemma":0.003472961,"domain_scores_codex":[0.998037,0.0008238573,0.00009329637,0.0002366431,0.0005555879,0.0002536342],"domain_scores_gemma":[0.9976757,0.001623273,0.0001633236,0.0002126741,0.0002291657,0.00009589356],"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.0002427709,0.0002683152,0.0005653872,0.0003623762,0.0001033611,0.0001855924,0.0001424186,0.5206536,0.002724261,0.2895134,0.009878224,0.1753604],"study_design_scores_gemma":[0.0000408334,0.00004348409,0.00009477277,0.00004563996,0.00002382904,0.00004077553,0.00002760292,0.8945891,0.001268737,0.09839493,0.00541791,0.00001247209],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003800598,0.0005505654,0.9903515,0.0003588983,0.00007753426,0.00007995915,0.00008517973,0.00009053736,0.004605135],"genre_scores_gemma":[0.1636356,0.001475798,0.8284003,0.0003660361,0.0002104698,0.0003449395,0.0005240573,0.0001823663,0.004860277],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00405727,"threshold_uncertainty_score":0.01357287,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08454693968172562,"score_gpt":0.3695019839405457,"score_spread":0.2849550442588201,"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."}}