{"id":"W2792362373","doi":"10.1287/trsc.2019.0941","title":"A Primal Adjacency-Based Algorithm for the Shortest Path Problem with Resource Constraints","year":2020,"lang":"en","type":"article","venue":"Transportation Science","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Shortest path problem; K shortest path routing; Mathematical optimization; Column generation; Yen's algorithm; Constrained Shortest Path First; Path (computing); Adjacency list; Computer science; Shortest Path Faster Algorithm; Longest path problem; Algorithm; Mathematics; Dijkstra's algorithm; 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.0002050106,0.00009658471,0.00007968648,0.0000331424,0.0001635363,0.00006423297,0.0002032036,0.00002245051,0.0000522486],"category_scores_gemma":[0.000007057088,0.00006804636,0.0000250153,0.0006011441,0.0003089527,0.000152335,9.562903e-7,0.00007768799,0.000003993697],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001355591,"about_ca_system_score_gemma":0.0001371775,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002053271,"about_ca_topic_score_gemma":0.000007779096,"domain_scores_codex":[0.9991696,0.000004643688,0.000160862,0.000194698,0.0002771264,0.0001931066],"domain_scores_gemma":[0.99961,0.00005905842,0.0000328472,0.00009872534,0.00009926345,0.000100095],"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.00001485065,0.00001365822,0.000751611,0.00004563279,0.000008702827,0.000002281852,0.0027775,0.9316031,0.0009737776,0.0009505199,0.0002018422,0.06265657],"study_design_scores_gemma":[0.0005379705,0.00009179331,0.002384474,0.00003053429,0.00001986042,8.742121e-7,0.0002101568,0.9890202,0.002026914,0.00001488355,0.005510509,0.0001518063],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001121934,0.00003592146,0.9963282,0.0007282773,0.00003444028,0.0005189747,0.00007820353,0.0002350586,0.0009190176],"genre_scores_gemma":[0.8333637,0.000005445832,0.1660268,0.0004555383,0.0000214856,0.00006112445,0.0000361798,0.00001693771,0.00001281373],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8322417,"threshold_uncertainty_score":0.277485,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01777199669640567,"score_gpt":0.2191625680337269,"score_spread":0.2013905713373212,"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."}}