{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001797946,0.0001216504,0.0001735939,0.0003085133,0.0004887178,0.0004633859,0.0000908665,0.00009127731,0.0000496065],"category_scores_gemma":[0.001277303,0.0001304302,0.00002280496,0.001264498,0.00008522517,0.000284791,0.0001571745,0.0004181184,0.00001876995],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007369385,"about_ca_system_score_gemma":0.00008963874,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001792379,"about_ca_topic_score_gemma":0.0001067326,"domain_scores_codex":[0.998138,0.000523503,0.0002979485,0.0002844166,0.0003697617,0.0003863676],"domain_scores_gemma":[0.9986697,0.0005010924,0.000008400068,0.0002429655,0.0004507588,0.0001271232],"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.000003534659,0.00009903614,0.004636077,0.0003818053,0.0001219917,0.00003272562,0.007482087,0.6364163,0.02679598,0.00489022,0.0003566837,0.3187835],"study_design_scores_gemma":[0.000367931,0.00002211268,0.001718923,0.00005320237,0.000005795114,0.00002766623,0.0007811356,0.983711,0.0124906,0.0000920003,0.0005717103,0.0001579355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5204917,0.004227262,0.4671526,0.0009516653,0.0001735772,0.0006184441,0.00004760803,0.0004350752,0.005902066],"genre_scores_gemma":[0.798546,0.0007928095,0.1987005,0.00003121278,0.0001082342,0.00008706832,0.0000275179,0.00004984938,0.00165679],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3472947,"threshold_uncertainty_score":0.5318791,"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."}}