{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001278537,0.0008807557,0.002101906,0.001041219,0.0007895931,0.001425108,0.003114657,0.002103307,0.00831022],"category_scores_gemma":[0.004975461,0.0007521216,0.000923028,0.002172355,0.0007884402,0.001962455,0.001854873,0.001871812,0.001500607],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001819474,"about_ca_system_score_gemma":0.002334904,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009569373,"about_ca_topic_score_gemma":0.009430279,"domain_scores_codex":[0.999228,0.0002851154,0.00003381871,0.0001491872,0.0001585514,0.0001453277],"domain_scores_gemma":[0.997826,0.001461818,0.0001457082,0.0001501366,0.0002672753,0.0001490066],"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.0003947086,0.0002485884,0.0005709618,0.0001388329,0.00004814034,0.00007088594,0.00007628042,0.8950191,0.0009003149,0.01113661,0.006115463,0.08528011],"study_design_scores_gemma":[0.00004399695,0.00002863755,0.0000398166,0.000005902253,0.000006330816,0.00001385271,0.00001231144,0.9975074,0.000107178,0.001936293,0.0002939956,0.000004336971],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03195769,0.0005696249,0.9584256,0.0005381361,0.0001014497,0.0001260367,0.0002316824,0.001142736,0.006906954],"genre_scores_gemma":[0.3794743,0.0003155096,0.6115346,0.0002645955,0.00009197833,0.0004172604,0.0007205541,0.0002542636,0.006926997],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009569373,"threshold_uncertainty_score":0.0278005,"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."}}