{"id":"W2029341065","doi":"10.1002/net.20033","title":"An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems","year":2004,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":665,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal","funders":"","keywords":"Column generation; Shortest path problem; Path (computing); Routing (electronic design automation); Vehicle routing problem; Computer science; Mathematical optimization; Computation; K shortest path routing; Longest path problem; Constrained Shortest Path First; Algorithm; Mathematics; Theoretical computer science; Graph","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.0007728843,0.0002061825,0.0001682821,0.00004077988,0.0002431107,0.00009913483,0.0002651525,0.00009484238,0.000006740194],"category_scores_gemma":[0.00000908758,0.0001651213,0.00003632824,0.0003287758,0.00005374839,0.0001857295,0.00002636866,0.0002434186,0.000002891615],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000142795,"about_ca_system_score_gemma":0.00002603792,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002751359,"about_ca_topic_score_gemma":0.00001994812,"domain_scores_codex":[0.9986975,0.00004427959,0.0003120204,0.0003159485,0.0001759472,0.0004543141],"domain_scores_gemma":[0.9992006,0.0001484839,0.00007014357,0.0003878121,0.00006421468,0.00012878],"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.000004499133,0.00002091642,0.0002176422,0.000007220614,0.00002596023,4.948296e-7,0.0002362995,0.7256218,0.00018961,0.0002394921,0.0000664521,0.2733696],"study_design_scores_gemma":[0.0006201129,0.0001481803,0.0003773007,0.0000797341,0.00003541831,0.000007515926,0.0002315664,0.9965013,0.0002178151,0.0001455896,0.001389282,0.000246178],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003101211,0.0001138979,0.9941126,0.0002302868,0.00005529507,0.001699423,0.00001451507,0.0005013429,0.0001714919],"genre_scores_gemma":[0.5673158,0.00001182286,0.4312564,0.000360296,0.0004087675,0.0004814431,0.00007564282,0.00008265812,0.000007154552],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5642146,"threshold_uncertainty_score":0.6733452,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008733564536156346,"score_gpt":0.2388332489582275,"score_spread":0.2300996844220712,"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."}}