{"id":"W2273624835","doi":"10.1007/s11590-016-0998-4","title":"A Lagrangian heuristic for concave cost facility location problems: the plant location and technology acquisition problem","year":2016,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":19,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Lagrangian relaxation; Mathematical optimization; Heuristic; Facility location problem; Lagrangian; Branch and bound; Computational intelligence; Upper and lower bounds; Mathematics; Minification; Set (abstract data type); Computer science; Integer (computer science); Applied mathematics; Artificial intelligence","routes":{"ca_aff":true,"ca_fund":false,"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.000406117,0.0001541256,0.0001170021,0.0002215442,0.0003049817,0.0001319504,0.0001493917,0.00006559728,0.00008852848],"category_scores_gemma":[0.0001411452,0.0001047335,0.0000246465,0.0006261392,0.0001335765,0.0006348,0.00005598513,0.00004466147,0.00007411507],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006938241,"about_ca_system_score_gemma":0.00001504606,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009014824,"about_ca_topic_score_gemma":0.0001052314,"domain_scores_codex":[0.9989594,0.00001788133,0.0003138818,0.000331768,0.0001593822,0.000217656],"domain_scores_gemma":[0.9991723,0.00003796659,0.0001359999,0.0002441911,0.0003974959,0.00001209377],"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.0002140927,0.0002538998,0.005927473,0.002174533,0.0001553572,0.000001264615,0.0005009479,0.8095557,0.003148794,0.08444327,0.04633105,0.04729359],"study_design_scores_gemma":[0.003638635,0.00005744592,0.004793165,0.0003690461,0.0002507477,0.000004413234,0.0007725253,0.8454506,0.0001921334,0.002373691,0.1412063,0.000891258],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003605347,0.00004057867,0.9110377,0.08280866,0.0001799384,0.001910129,0.00002787305,0.0001846158,0.0002052038],"genre_scores_gemma":[0.9921136,0.00004273469,0.001556834,0.004654923,0.0001566244,0.000778974,0.0004714431,0.00001720056,0.0002075886],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9885083,"threshold_uncertainty_score":0.4270908,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01575863942459743,"score_gpt":0.2026103310353574,"score_spread":0.18685169161076,"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."}}