{"id":"W1999614211","doi":"10.1057/palgrave.jors.2601590","title":"Exact solution of the generalized routing problem through graph transformations","year":2003,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":29,"is_retracted":false,"has_abstract":true,"ca_institutions":"HEC Montréal","funders":"","keywords":"Travelling salesman problem; Graph traversal; Vehicle routing problem; Mathematical optimization; Computer science; Graph; Tree traversal; Scheduling (production processes); Routing (electronic design automation); Mathematics; Combinatorics; Theoretical computer science; Algorithm","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.000361384,0.0006988998,0.0007405144,0.0003731011,0.0003321261,0.0007236238,0.0007053256,0.0007254349,0.004129132],"category_scores_gemma":[0.001623418,0.0003055796,0.0005780058,0.0006636704,0.0008560307,0.001468913,0.001126889,0.001033154,0.0005257219],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005866253,"about_ca_system_score_gemma":0.0009912966,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003414597,"about_ca_topic_score_gemma":0.003667352,"domain_scores_codex":[0.9996909,0.0001011453,0.000008322208,0.00006710351,0.00008553711,0.00004692092],"domain_scores_gemma":[0.9997368,0.0001324936,0.00002646135,0.00006755763,0.000026361,0.00001032099],"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.0000526294,0.00004027178,0.0001657754,0.00006957384,0.00001523234,0.00009882922,0.00006990559,0.8443411,0.002380081,0.08112227,0.002300026,0.06934439],"study_design_scores_gemma":[0.00002394017,0.00002035286,0.00006956341,0.000005424964,0.000004819939,0.00003576555,0.00003051011,0.8983857,0.0006589147,0.0987917,0.001968686,0.00000461958],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04432214,0.0002476201,0.9429332,0.0002807496,0.00005504613,0.00005025581,0.00009230879,0.0004987501,0.01151998],"genre_scores_gemma":[0.5762164,0.0005155811,0.4135321,0.0001173024,0.00005846672,0.0001535655,0.0003005629,0.0002735835,0.008832385],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004129132,"threshold_uncertainty_score":0.01381338,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06518996431258268,"score_gpt":0.3566540850713895,"score_spread":0.2914641207588068,"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."}}