{"id":"W2759640845","doi":"10.1007/s10878-017-0179-0","title":"A local search approximation algorithm for the uniform capacitated k-facility location problem","year":2017,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":12,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Facility location problem; Theory of computation; Constraint (computer-aided design); Set (abstract data type); Cardinality (data modeling); Computer science; Approximation algorithm; Mathematical optimization; 1-center problem; Combinatorial optimization; Local search (optimization); Total cost; Service (business); Algorithm; Mathematics; Database","routes":{"ca_aff":true,"ca_fund":true,"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.001877186,0.0001342382,0.0001855528,0.0001625268,0.0008501087,0.0005776275,0.0004878589,0.00007506526,0.00005999831],"category_scores_gemma":[0.0003724728,0.0001009035,0.0001035489,0.0002412627,0.0001122908,0.002147847,0.00007772928,0.0001477905,0.0000155085],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001191346,"about_ca_system_score_gemma":0.0000771635,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003222315,"about_ca_topic_score_gemma":0.0000130666,"domain_scores_codex":[0.9985964,0.00002172873,0.0005773352,0.0001410871,0.0004806836,0.000182728],"domain_scores_gemma":[0.996821,0.00004085918,0.0005640336,0.0003295311,0.002225973,0.00001864432],"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.0001501856,0.0001885557,0.0001051041,0.000179682,0.00007600272,5.442737e-7,0.0001183689,0.8968061,0.000008061302,0.02562086,0.00179222,0.07495437],"study_design_scores_gemma":[0.001628284,0.0000468234,0.0005963891,0.00003147522,0.00009148964,0.000001020949,0.0003333974,0.9846468,0.00004373529,0.004479831,0.007980903,0.0001198286],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0009819363,0.00002559188,0.9918041,0.002723258,0.002856319,0.000751852,0.000004701822,0.0000259914,0.000826207],"genre_scores_gemma":[0.9705629,0.00005090493,0.02759453,0.0002019286,0.001252219,0.00005051194,0.0001014615,0.00001995178,0.0001655832],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9695809,"threshold_uncertainty_score":0.6538435,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0288429195336987,"score_gpt":0.2576009970994438,"score_spread":0.2287580775657451,"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."}}