{"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":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.005724961,0.00007294017,0.00007072679,0.0001141954,0.0005623946,0.001218444,0.001675545,0.000006043254,0.00001066277],"category_scores_gemma":[0.0001225561,0.00003860334,0.00003356855,0.0003845434,0.0001102654,0.001052524,0.0003536882,0.0003702778,0.0001133484],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005005144,"about_ca_system_score_gemma":0.0003121115,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003097463,"about_ca_topic_score_gemma":0.000004187875,"domain_scores_codex":[0.9976346,0.0003659663,0.0002746833,0.0001504766,0.001308235,0.0002660455],"domain_scores_gemma":[0.9986665,0.0001314611,0.00007543842,0.0002888522,0.000727243,0.0001104884],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00009520059,0.0003191175,0.0005423587,0.00001040601,0.0001384507,0.002886893,0.001242976,0.006129935,0.0006633791,0.7609162,0.03323012,0.193825],"study_design_scores_gemma":[0.006875144,0.008963788,0.05203063,0.0006935255,0.00002444507,0.001667815,0.001133886,0.01233892,0.001241493,0.02739657,0.8867756,0.0008582106],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02032617,0.0006785237,0.8315092,0.04269265,0.0003837827,0.000619171,0.000008332395,0.00004538456,0.1037368],"genre_scores_gemma":[0.8944978,0.0002072725,0.102076,0.0002224558,0.000566065,0.000004088182,0.000004832858,0.00002052924,0.002401012],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8741716,"threshold_uncertainty_score":0.9998184,"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."}}