{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001011822,0.0006259591,0.0007390344,0.0005149218,0.0005305457,0.0005611134,0.001001948,0.0008630053,0.004313316],"category_scores_gemma":[0.003222576,0.0003526467,0.0004565828,0.0008551087,0.000597324,0.0010228,0.000792757,0.001098242,0.0004106498],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006947512,"about_ca_system_score_gemma":0.001624104,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004946777,"about_ca_topic_score_gemma":0.006324674,"domain_scores_codex":[0.99949,0.0001853801,0.00002285411,0.00009539873,0.0001331752,0.0000730422],"domain_scores_gemma":[0.9983544,0.001078356,0.00009562864,0.0002320971,0.0001949033,0.00004446101],"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.0001215599,0.0001117728,0.0004590939,0.0001332479,0.00002460926,0.00008006347,0.0001089518,0.7970908,0.003157179,0.02831965,0.002853314,0.1675397],"study_design_scores_gemma":[0.00005670058,0.00004036829,0.00008031318,0.000005979515,0.000005976055,0.00003885492,0.00002005282,0.9841042,0.001208794,0.01320619,0.001226064,0.000006549544],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02541918,0.00008671012,0.9714353,0.00015681,0.00002667244,0.00009335057,0.00006803677,0.0006087402,0.002105125],"genre_scores_gemma":[0.1461319,0.0000717707,0.8519684,0.00006075146,0.00001917615,0.0001290945,0.0001682304,0.0001009748,0.001349725],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004946777,"threshold_uncertainty_score":0.01442951,"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."}}