{"id":"W1964065477","doi":"10.1016/j.cor.2011.01.015","title":"Optimal search path for service in the presence of disruptions","year":2011,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":10,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Path (computing); Heuristic; Facility location problem; Node (physics); Mathematical optimization; Set (abstract data type); Service (business); Dynamic programming; Flow network; State (computer science); Operations research; Algorithm; Mathematics; Artificial intelligence; Computer network","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.0007433837,0.0005959683,0.001319505,0.00178456,0.0006261062,0.001500034,0.0009041202,0.002008768,0.00934427],"category_scores_gemma":[0.006067673,0.0006715127,0.0005951163,0.001168752,0.0006664371,0.001799672,0.0009228688,0.001072991,0.0006476315],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001288973,"about_ca_system_score_gemma":0.002851097,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0162669,"about_ca_topic_score_gemma":0.009034442,"domain_scores_codex":[0.9996367,0.0001095978,0.00001401677,0.00006534946,0.00004625021,0.0001280525],"domain_scores_gemma":[0.9977754,0.001640223,0.0001396434,0.00004326512,0.0002053859,0.0001960215],"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.0007889515,0.00009758546,0.002194991,0.0001188863,0.0000560739,0.0002055049,0.0001615368,0.952099,0.0009696364,0.01330696,0.004048182,0.02595279],"study_design_scores_gemma":[0.00003923197,0.00006161116,0.0004268564,0.0000128612,0.00001412894,0.00003768615,0.0001194394,0.9909626,0.0001650097,0.007723542,0.0004294029,0.000007657516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5572154,0.001574746,0.4089028,0.004645498,0.0001660281,0.0002935301,0.001274348,0.0006654734,0.02526234],"genre_scores_gemma":[0.9505177,0.0002983382,0.04209674,0.000113513,0.00003745904,0.00006780537,0.0004588501,0.00008287572,0.006326687],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0162669,"threshold_uncertainty_score":0.0323444,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1976220243980266,"score_gpt":0.3627047899932483,"score_spread":0.1650827655952217,"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."}}