{"id":"W2521482842","doi":"10.1007/s10878-016-0080-2","title":"An approximation algorithm for k-facility location problem with linear penalties using local search scheme","year":2016,"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; Zhàng; Local search (optimization); Extension (predicate logic); Approximation algorithm; Algorithm; Scheme (mathematics); Mathematics; 1-center problem; Computer science; Contrast (vision); Mathematical optimization; Combinatorics; Artificial intelligence","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.001177231,0.0001561834,0.0002186823,0.0002951732,0.0001913814,0.000139764,0.0001997638,0.00007631343,0.00007361344],"category_scores_gemma":[0.00008842102,0.0001094967,0.00006202965,0.0004641619,0.00007161704,0.002982397,0.0000309612,0.00008081672,0.000007538808],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001654165,"about_ca_system_score_gemma":0.0001174493,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008686628,"about_ca_topic_score_gemma":0.000004301396,"domain_scores_codex":[0.9984621,0.00003670514,0.0005830543,0.0001936103,0.0005253105,0.0001992445],"domain_scores_gemma":[0.9968939,0.00002407202,0.0003511001,0.0001766496,0.002523844,0.00003044724],"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.0004328141,0.0003826256,0.0004842778,0.0002505009,0.00005742084,7.843677e-7,0.00007553878,0.9501212,0.0002819459,0.009539437,0.0001469845,0.03822643],"study_design_scores_gemma":[0.002458188,0.0001775426,0.0001152333,0.00009607254,0.00006554359,0.000002093378,0.0002343111,0.9939117,0.0003321059,0.001281708,0.001146603,0.0001788722],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01411325,0.00001341569,0.9839106,0.0004919512,0.0008253254,0.0005273697,0.000004659435,0.00003895298,0.00007446775],"genre_scores_gemma":[0.6827602,0.00001588881,0.3156177,0.0001034977,0.001331723,0.00002122949,0.00007828265,0.00002766105,0.00004390686],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6686469,"threshold_uncertainty_score":0.4465147,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02624823424378466,"score_gpt":0.2613735980046961,"score_spread":0.2351253637609114,"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."}}