{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001994245,0.001803154,0.001141761,0.00125482,0.0007742333,0.002031554,0.002345166,0.001262337,0.004198512],"category_scores_gemma":[0.004954806,0.0008248432,0.001361122,0.002023813,0.0007779688,0.002073176,0.002052779,0.003451012,0.0008604496],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001480583,"about_ca_system_score_gemma":0.002608928,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004079201,"about_ca_topic_score_gemma":0.004568605,"domain_scores_codex":[0.9982262,0.0005767823,0.0001293457,0.0002381318,0.0005268578,0.0003026846],"domain_scores_gemma":[0.9975454,0.001470467,0.0002583887,0.0002374765,0.0003502055,0.0001380295],"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.0001861455,0.0002380233,0.0007155364,0.0003197371,0.00007870499,0.0002121584,0.000128352,0.685681,0.00333841,0.09932799,0.006073663,0.2037004],"study_design_scores_gemma":[0.00004835121,0.00005348818,0.0001018144,0.00002880404,0.00002342616,0.00004526708,0.00002738889,0.9518201,0.001578278,0.04296433,0.003296122,0.00001255614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005132635,0.0002394924,0.9907907,0.0001588154,0.00004787249,0.0001119994,0.000197304,0.0002114965,0.0031097],"genre_scores_gemma":[0.09532583,0.0004581924,0.9001941,0.0001597662,0.00006260702,0.0003358437,0.0009430349,0.0002034962,0.002317206],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004198512,"threshold_uncertainty_score":0.01404548,"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."}}