{"id":"W2413161265","doi":"10.1287/trsc.2016.0692","title":"A Lagrangian-Based Branch-and-Bound Algorithm for the Two-Level Uncapacitated Facility Location Problem with Single-Assignment Constraints","year":2016,"lang":"en","type":"article","venue":"Transportation Science","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":44,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal","funders":"","keywords":"Lagrangian relaxation; Mathematical optimization; Facility location problem; Branch and bound; Heuristic; Linear programming relaxation; Integer programming; Lagrangian; Computer science; Branch and price; Relaxation (psychology); Mathematics; Applied mathematics","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.001058756,0.001109958,0.001462668,0.0009021771,0.0007151166,0.00134739,0.001728773,0.001415944,0.007205608],"category_scores_gemma":[0.003215853,0.0006391725,0.0007248585,0.001313063,0.0006644616,0.00114843,0.001423107,0.002004838,0.001312374],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001721648,"about_ca_system_score_gemma":0.002682762,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006125655,"about_ca_topic_score_gemma":0.007318596,"domain_scores_codex":[0.9994494,0.0001616783,0.00001964395,0.00009461052,0.0001448124,0.0001299107],"domain_scores_gemma":[0.9990745,0.0005467818,0.00007868995,0.00008526388,0.0001325457,0.0000822034],"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.00006258072,0.0001384207,0.0002780672,0.0000928813,0.00002778325,0.00007700732,0.00007501734,0.892291,0.001237268,0.02186304,0.004509699,0.0793473],"study_design_scores_gemma":[0.00002381353,0.0000152398,0.0000316801,0.000006643531,0.000004208621,0.00001006681,0.000009838992,0.9944409,0.0002260816,0.004510524,0.0007178224,0.000003142411],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007443703,0.0001273232,0.9859783,0.0002265036,0.00002716728,0.0001021121,0.00009210815,0.0004955495,0.005507233],"genre_scores_gemma":[0.1267382,0.0002097656,0.869019,0.0001546629,0.00003328195,0.0003664728,0.0004540719,0.0002114667,0.00281314],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007205608,"threshold_uncertainty_score":0.02410513,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04783518975537899,"score_gpt":0.247349140226502,"score_spread":0.199513950471123,"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."}}