{"id":"W2019468200","doi":"10.1016/j.cor.2008.02.009","title":"Formulations and relaxations for a multi-echelon capacitated location–distribution problem","year":2008,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":64,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Montréal; Computer Research Institute of Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Linear programming relaxation; Relaxation (psychology); Mathematical optimization; Path (computing); Linear programming; Mathematics; Integer programming; Binary number; Upper and lower bounds; Simple (philosophy); Integer (computer science); Point (geometry); Distribution (mathematics); Computer science","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":["sts"],"consensus_categories":[],"category_scores_codex":[0.0006582195,0.0001302512,0.0001206601,0.0004054169,0.002199587,0.0002854305,0.0001933338,0.00006424189,0.00004658118],"category_scores_gemma":[0.0003828323,0.0001344454,0.0000426236,0.001285475,0.0001744721,0.001121006,0.0001381473,0.0001624843,0.0001917398],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001116619,"about_ca_system_score_gemma":0.00009179433,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001744345,"about_ca_topic_score_gemma":0.002227826,"domain_scores_codex":[0.9986029,0.00003538506,0.0003498248,0.0003634707,0.0003170925,0.0003312868],"domain_scores_gemma":[0.9978288,0.00005177481,0.00002080439,0.0002806952,0.001786259,0.00003161536],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005283268,0.0008319638,0.002365382,0.0005196633,0.0001080874,0.000002816126,0.00177114,0.3019786,0.000526308,0.5867929,0.09388158,0.01116872],"study_design_scores_gemma":[0.0006654381,0.000021133,0.009936993,0.0000258621,0.0000125492,0.000002608242,0.0002335148,0.9451437,0.00002422976,0.00054291,0.04322662,0.0001644164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1028577,0.00008366968,0.8889821,0.004981598,0.0002083466,0.002055346,0.00003040189,0.0001866063,0.0006142571],"genre_scores_gemma":[0.9685128,0.00005538432,0.02709099,0.0003003353,0.0002143553,0.0006621594,0.001476773,0.00001875527,0.001668461],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8656551,"threshold_uncertainty_score":0.9990994,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2016044137546952,"score_gpt":0.3583772366091318,"score_spread":0.1567728228544366,"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."}}