{"id":"W1563143451","doi":"","title":"The α-reliable shortest path problem","year":2008,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Shortest path problem; Mathematical optimization; Computer science; Path (computing); Heuristic; Knapsack problem; Set (abstract data type); Integer programming; A priori and a posteriori; Constrained Shortest Path First; Longest path problem; Mathematics; K shortest path routing; Theoretical computer science","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002068269,0.001446907,0.001396433,0.0009550092,0.0007416843,0.001429164,0.001533518,0.001796684,0.005116199],"category_scores_gemma":[0.008016433,0.0005471645,0.00070909,0.001774139,0.001039892,0.002349988,0.001103095,0.001234122,0.0007944411],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008410292,"about_ca_system_score_gemma":0.001237726,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001754999,"about_ca_topic_score_gemma":0.0009835385,"domain_scores_codex":[0.9981913,0.0007744547,0.0001167035,0.0003838193,0.0003326304,0.00020106],"domain_scores_gemma":[0.9966469,0.002169885,0.0005367103,0.0001947237,0.0002750237,0.0001767093],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001475356,0.00005686295,0.0005034046,0.0003525141,0.0000643992,0.0002551492,0.0001196394,0.8982842,0.001142678,0.05300562,0.003907198,0.04216073],"study_design_scores_gemma":[0.00007302197,0.0001687048,0.0004189012,0.00005789496,0.00003692282,0.0003759925,0.0001546624,0.8399058,0.0009443453,0.1486382,0.009193487,0.00003204302],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06722223,0.00168386,0.9110356,0.001440207,0.000152701,0.00033214,0.001263569,0.0003999125,0.01646977],"genre_scores_gemma":[0.7298191,0.003100581,0.2535618,0.0002255224,0.0002870291,0.0006457614,0.001670715,0.0002310042,0.01045849],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005116199,"threshold_uncertainty_score":0.01711535,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08721923934476747,"score_gpt":0.3182600762586555,"score_spread":0.231040836913888,"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."}}