{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007577264,0.0009624505,0.0009959433,0.001179561,0.0008408168,0.001116093,0.001132703,0.001104885,0.005447691],"category_scores_gemma":[0.002418015,0.0006045388,0.0006860044,0.001356692,0.0005992968,0.00155265,0.001644807,0.001739461,0.001107675],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007641671,"about_ca_system_score_gemma":0.001962492,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002697445,"about_ca_topic_score_gemma":0.002605451,"domain_scores_codex":[0.9994274,0.0002008344,0.00002397724,0.0001118841,0.0001708626,0.00006512296],"domain_scores_gemma":[0.9993438,0.0003736004,0.00005857428,0.00005403356,0.0001279492,0.0000419935],"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.00009111268,0.0001628545,0.0003941239,0.0001922708,0.00003738876,0.0001060539,0.0001663631,0.711494,0.003518989,0.0739923,0.007183116,0.2026614],"study_design_scores_gemma":[0.00002076606,0.00003806765,0.00004374967,0.00001266324,0.000006755475,0.00005212797,0.00002227506,0.9830244,0.0005585919,0.01314535,0.0030676,0.000007760947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004930036,0.0001656736,0.9903858,0.0001275589,0.00005412207,0.00008587437,0.0000536363,0.0002623764,0.003935015],"genre_scores_gemma":[0.09010372,0.0003004656,0.9053175,0.000112872,0.00005883792,0.0002847731,0.0002884659,0.0001379195,0.003395332],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005447691,"threshold_uncertainty_score":0.0182243,"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."}}