{"id":"W2083833523","doi":"10.1007/s10878-009-9213-1","title":"An approximation algorithm for the k-level capacitated facility location problem","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":21,"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; 1-center problem; Approximation algorithm; Combinatorics; Mathematics; Combinatorial optimization; Mathematical optimization; Supply chain management; Computer science; Discrete mathematics; Algorithm; Supply chain","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.001249723,0.0001303631,0.000166055,0.0001849768,0.0002587728,0.0002498965,0.0002650421,0.00006566454,0.00004740423],"category_scores_gemma":[0.0001935508,0.00009953413,0.00008149128,0.0005368312,0.00002561408,0.002006117,0.00001153693,0.0001032293,0.00000737287],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007473849,"about_ca_system_score_gemma":0.00004334775,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005090202,"about_ca_topic_score_gemma":0.000002774199,"domain_scores_codex":[0.9987077,0.00002735213,0.0006022244,0.0001354954,0.0003795926,0.0001477017],"domain_scores_gemma":[0.9975981,0.00002739567,0.0004114826,0.0001856094,0.001759854,0.00001753168],"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.0001161725,0.000385385,0.00003443446,0.00005529871,0.00003486257,2.511232e-7,0.0001344197,0.8774667,0.00005097628,0.02489576,0.002240206,0.0945855],"study_design_scores_gemma":[0.001326272,0.0001181398,0.001061326,0.00001678534,0.00009192072,8.525032e-7,0.0002104819,0.9799412,0.00003946581,0.01188656,0.005175043,0.0001319965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001347797,0.00003116922,0.993495,0.002068175,0.002055848,0.0006722643,0.000005638367,0.00004200533,0.0002821235],"genre_scores_gemma":[0.9078012,0.00003744696,0.08895041,0.0008957806,0.001913389,0.00003422777,0.0002736566,0.00001642362,0.00007744569],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9064534,"threshold_uncertainty_score":0.4058884,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02788160282492381,"score_gpt":0.248890497160571,"score_spread":0.2210088943356472,"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."}}