{"id":"W2040572217","doi":"10.1016/j.ejor.2004.01.032","title":"The shortest path problem with forbidden paths","year":2004,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":80,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Shortest path problem; Constrained Shortest Path First; K shortest path routing; Longest path problem; Shortest Path Faster Algorithm; Euclidean shortest path; Yen's algorithm; Distance; Widest path problem; Mathematics; Matching (statistics); Path (computing); Mathematical optimization; Algorithm; Computer science; Graph; Combinatorics; Dijkstra's 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00137016,0.0008822822,0.001342832,0.001023785,0.00131656,0.002502292,0.002492523,0.002314577,0.007157907],"category_scores_gemma":[0.009853308,0.0008451234,0.001052172,0.002255865,0.001529666,0.005847333,0.002421103,0.002444435,0.000815251],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001038389,"about_ca_system_score_gemma":0.002144352,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0022691,"about_ca_topic_score_gemma":0.001882712,"domain_scores_codex":[0.9984249,0.0006066761,0.00009328832,0.0003460265,0.0003009202,0.0002281876],"domain_scores_gemma":[0.993147,0.005266498,0.0004041354,0.0004404887,0.0003618646,0.0003800874],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001137943,0.0002808515,0.001378858,0.001259022,0.0002188752,0.0006224866,0.0003779362,0.4187558,0.00316356,0.4287894,0.02266174,0.1213536],"study_design_scores_gemma":[0.0001668112,0.00009334968,0.0002404025,0.00005931353,0.00005736219,0.0003557221,0.0001510151,0.2660542,0.001157905,0.7206582,0.01097914,0.00002653498],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1473683,0.002324096,0.81696,0.004281403,0.0004442914,0.0002580561,0.002300018,0.0006991111,0.0253646],"genre_scores_gemma":[0.6127287,0.00289496,0.3576572,0.0004331409,0.0004550666,0.0003946532,0.004036723,0.0004334401,0.02096602],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007157907,"threshold_uncertainty_score":0.02394551,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.057786834878117,"score_gpt":0.3184309854111493,"score_spread":0.2606441505330324,"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."}}