{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001391171,0.0009382676,0.002526519,0.0009255233,0.0009443819,0.001436182,0.00372528,0.002074743,0.007094682],"category_scores_gemma":[0.004151827,0.0007878953,0.00105925,0.002062444,0.0007684255,0.002213767,0.001935043,0.002024271,0.001129207],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002031013,"about_ca_system_score_gemma":0.003155555,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01076448,"about_ca_topic_score_gemma":0.0095162,"domain_scores_codex":[0.9990236,0.0003358338,0.00004730389,0.0001737232,0.0002177259,0.0002019375],"domain_scores_gemma":[0.9981875,0.001073955,0.0001410858,0.0002014725,0.0002395372,0.0001564315],"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.0004206861,0.0003467271,0.000614614,0.0001912664,0.00005069526,0.00007509456,0.00009260728,0.8939023,0.001666724,0.01571578,0.005793373,0.0811302],"study_design_scores_gemma":[0.000036121,0.00002962953,0.00004754037,0.000005201203,0.00000621743,0.00001668843,0.00001098987,0.9974718,0.0001565908,0.001975117,0.0002392084,0.00000485218],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02662939,0.000399297,0.9672626,0.0003981498,0.00008734155,0.0001498037,0.0001564142,0.0008563604,0.00406057],"genre_scores_gemma":[0.3442145,0.0002478627,0.6488337,0.0002163065,0.00006299269,0.0004490168,0.0004954669,0.0001679736,0.005312146],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01076448,"threshold_uncertainty_score":0.02373409,"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."}}