{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004594842,0.00008752468,0.000143373,0.00003471109,0.0006072943,0.00007009522,0.0003696421,0.00007921074,0.00005740663],"category_scores_gemma":[0.0005681177,0.00005151903,0.0003573459,0.0007575324,0.0001354124,0.0004124402,0.00003289842,0.0006614179,0.000001102785],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002044856,"about_ca_system_score_gemma":0.00032345,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009071856,"about_ca_topic_score_gemma":0.000003147205,"domain_scores_codex":[0.9974033,0.0007600363,0.0005392811,0.0000656486,0.000998244,0.0002334548],"domain_scores_gemma":[0.9986029,0.000269716,0.0001272225,0.0001833768,0.0007749162,0.00004181718],"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.000004911621,0.00003687574,0.0005009025,0.00004033314,0.0001107175,9.349337e-8,0.003250176,0.936942,0.03663018,0.01549283,0.006804238,0.0001867769],"study_design_scores_gemma":[0.002957531,0.0001163721,0.005964359,0.0005007114,0.0001006721,0.0001473733,0.002269519,0.7826799,0.1695546,0.02112997,0.01418181,0.0003971398],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2527702,0.0008789525,0.7270448,0.007870351,0.0008757974,0.0009817462,0.00002702133,0.00004289506,0.009508182],"genre_scores_gemma":[0.8429481,0.0003068354,0.15631,0.00008271962,0.00009788688,0.000008042282,0.000001176602,0.00001878052,0.0002264032],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5901778,"threshold_uncertainty_score":0.4670879,"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."}}