{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003341787,0.001474866,0.001683478,0.001141908,0.0009531393,0.00379178,0.002825559,0.003583235,0.01088571],"category_scores_gemma":[0.008015367,0.00153491,0.001984662,0.002455072,0.001547037,0.00285664,0.002652019,0.003415552,0.0009344807],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002654743,"about_ca_system_score_gemma":0.002216837,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01293186,"about_ca_topic_score_gemma":0.01028008,"domain_scores_codex":[0.9986029,0.0005845136,0.00006946272,0.000263343,0.0002709869,0.0002087441],"domain_scores_gemma":[0.996769,0.002394349,0.0002618046,0.0001476014,0.0002954731,0.0001318076],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006684223,0.0001037491,0.0002699608,0.0002080356,0.00004114325,0.0001313504,0.00008662889,0.9444678,0.0003067663,0.03613281,0.004117487,0.01406744],"study_design_scores_gemma":[0.00002659506,0.00002618709,0.0001485603,0.00003045442,0.00001454926,0.00004018198,0.00006519828,0.9746459,0.0001471754,0.02264019,0.002199474,0.00001552176],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03070058,0.002452824,0.9103721,0.00353554,0.000430306,0.0002408704,0.001041103,0.0001435908,0.05108319],"genre_scores_gemma":[0.5211337,0.002488069,0.4431196,0.0009046127,0.0007873105,0.0007952893,0.001294999,0.0003131573,0.02916322],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01293186,"threshold_uncertainty_score":0.03641635,"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."}}