{"id":"W1992769367","doi":"10.1016/j.disopt.2014.03.001","title":"A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints","year":2014,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":212,"is_retracted":false,"has_abstract":false,"ca_institutions":"Group for Research in Decision Analysis; Université du Québec à Montréal","funders":"","keywords":"Vehicle routing problem; Mathematical optimization; Set (abstract data type); Routing (electronic design automation); Mathematics; Upper and lower bounds; Algorithm; Branch and cut; Computer science; Linear programming","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.000961261,0.0009078022,0.001520271,0.0009199791,0.0006053105,0.001384913,0.002108136,0.001616288,0.007086833],"category_scores_gemma":[0.002874703,0.0007413279,0.000754336,0.001495319,0.0006204838,0.002019308,0.001472174,0.001760157,0.001234281],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001275996,"about_ca_system_score_gemma":0.002323449,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005606479,"about_ca_topic_score_gemma":0.007684908,"domain_scores_codex":[0.999364,0.0001117724,0.00002978606,0.0001288039,0.0002892607,0.00007645263],"domain_scores_gemma":[0.9991525,0.0004435983,0.00005690002,0.0001106767,0.0001858635,0.00005041596],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001461773,0.0001399749,0.0002779543,0.0001604515,0.00004634264,0.00006232237,0.00006612585,0.6855214,0.002707109,0.03102729,0.006619652,0.2732252],"study_design_scores_gemma":[0.00005031504,0.00002278929,0.00004596514,0.000008924653,0.000006706189,0.0000238646,0.000008537439,0.9894792,0.0003435644,0.007781419,0.002221734,0.000006853892],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002527856,0.0001276134,0.9942898,0.0001018262,0.0001030901,0.00004285523,0.0000503841,0.0003457993,0.002410844],"genre_scores_gemma":[0.05838074,0.000210787,0.935883,0.0001395353,0.00009040764,0.000204425,0.0002065835,0.0001677159,0.00471673],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007086833,"threshold_uncertainty_score":0.02370787,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02244022931863883,"score_gpt":0.2567384899092984,"score_spread":0.2342982605906596,"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."}}