{"id":"W2057635030","doi":"10.1007/s10589-013-9544-9","title":"A cutting plane algorithm for the Capacitated Connected Facility Location Problem","year":2013,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Montréal; Center for Interuniversity Research and Analysis on Organizations","funders":"","keywords":"Facility location problem; 1-center problem; Integer programming; Mathematical optimization; Network planning and design; Branch and cut; Set (abstract data type); Set cover problem; Integer (computer science); Mathematics; Cutting-plane method; Theory of computation; Cover (algebra); Computer science; Algorithm; Computer network; Engineering","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006095323,0.001013161,0.001130669,0.001063857,0.0006361463,0.001133245,0.001884481,0.001987565,0.00749848],"category_scores_gemma":[0.002236864,0.0008553939,0.001021864,0.001903043,0.0005846262,0.001103626,0.001370021,0.002338004,0.001215239],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007397707,"about_ca_system_score_gemma":0.001444165,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005991849,"about_ca_topic_score_gemma":0.005228537,"domain_scores_codex":[0.9996644,0.00007577244,0.00001485347,0.0000600878,0.0001441327,0.0000407763],"domain_scores_gemma":[0.9993364,0.0003692556,0.00004460341,0.000053765,0.0001584834,0.00003750865],"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.0001389928,0.0002002065,0.0003961066,0.0001084125,0.00005803987,0.00008720964,0.00008518529,0.6817281,0.003052849,0.03230688,0.006277038,0.275561],"study_design_scores_gemma":[0.00003363411,0.00003599426,0.00007146879,0.00001148514,0.00001041411,0.00002621154,0.00001147841,0.9875788,0.0004921706,0.009718505,0.002002415,0.000007420315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004674876,0.00008236492,0.992348,0.00007697431,0.00004171178,0.0000496504,0.00006011092,0.0002278591,0.002438514],"genre_scores_gemma":[0.05799975,0.0001702041,0.9379981,0.00008581235,0.00003820555,0.0002530767,0.0003042814,0.0001335305,0.003017077],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00749848,"threshold_uncertainty_score":0.02508491,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01438451474703852,"score_gpt":0.2430500121766642,"score_spread":0.2286654974296257,"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."}}