{"id":"W2938533079","doi":"","title":"Valid Inequalities and a Branch-and-Cut Algorithm for Asymmetric Multi-Depot Routing Problems","year":2019,"lang":"en","type":"article","venue":"","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université Laval","funders":"","keywords":"Travelling salesman problem; Branch and cut; Vehicle routing problem; Mathematical optimization; Routing (electronic design automation); Benchmark (surveying); Set (abstract data type); Triangle inequality; Mathematics; Computer science; Node (physics); Traveling purchaser problem; Column generation; Algorithm; 2-opt; Integer programming; Combinatorics; Engineering","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.000626155,0.0001607771,0.000237031,0.0001606549,0.00005869196,0.00008821202,0.0000641404,0.00009176543,0.00001633298],"category_scores_gemma":[0.0001423216,0.0001546107,0.00003533991,0.0002486556,0.00001714526,0.0001632684,0.00004607251,0.0001016351,0.000007427924],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000266874,"about_ca_system_score_gemma":0.00000846885,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003530411,"about_ca_topic_score_gemma":0.000004073147,"domain_scores_codex":[0.999082,0.00004472268,0.0002808905,0.0002174865,0.0001017436,0.0002731868],"domain_scores_gemma":[0.999317,0.0003797633,0.00004049862,0.0001367492,0.00005627123,0.00006965779],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007037082,0.00005455528,0.02103439,0.001394051,0.0002061702,0.000001469745,0.003643712,0.1634697,0.003852016,0.004012559,0.0001621051,0.8021622],"study_design_scores_gemma":[0.0009723596,0.00003543937,0.0008299175,0.00003746373,0.00001430667,0.00001041726,0.0001717728,0.9946257,0.002620647,0.0001095614,0.000343324,0.0002290637],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04405642,0.0003446472,0.952933,0.00003261455,0.0001897686,0.000514409,0.00001124515,0.0004551841,0.001462688],"genre_scores_gemma":[0.3892308,0.00005236251,0.6093159,0.00005039529,0.00004889967,0.0000338596,0.00000624901,0.00005236718,0.001209157],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.831156,"threshold_uncertainty_score":0.6304842,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03342638280313788,"score_gpt":0.2810655429353093,"score_spread":0.2476391601321715,"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."}}