{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001960973,0.00007803195,0.00009204375,0.0003653209,0.0003698879,0.0001649943,0.000720142,0.00002877254,0.0001508393],"category_scores_gemma":[0.0001235001,0.0000612907,0.00004137424,0.001317683,0.00009658789,0.000568843,0.0002751395,0.0001603294,0.0001308199],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002155579,"about_ca_system_score_gemma":0.00004644189,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007296684,"about_ca_topic_score_gemma":0.003823075,"domain_scores_codex":[0.998729,0.00007488012,0.0002623975,0.0002278574,0.0004128124,0.0002930642],"domain_scores_gemma":[0.998761,0.00008046177,0.000008417535,0.000401002,0.0007379676,0.00001113961],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001258206,0.001485156,0.003572047,0.0008415657,0.00005126555,0.000005410646,0.014407,0.3721698,0.0005041182,0.5782778,0.01992685,0.008633238],"study_design_scores_gemma":[0.0003677108,0.00003625175,0.02685506,0.00003930413,0.000007341904,4.659372e-7,0.004762755,0.9600968,0.00003929192,0.000372996,0.007309436,0.0001126299],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8831961,0.00005528515,0.09626397,0.009197515,0.0003285939,0.00254026,0.00001410706,0.0000479646,0.008356244],"genre_scores_gemma":[0.9942078,0.00001224177,0.004654402,0.0004528369,0.0001314382,0.0002779149,0.00004809679,0.000007948559,0.000207324],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.587927,"threshold_uncertainty_score":0.9993138,"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."}}