{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009754564,0.0001536642,0.000111096,0.0001460476,0.0004672322,0.000181454,0.0002315337,0.00002251695,0.0001541497],"category_scores_gemma":[0.00004288617,0.00008846397,0.00003384949,0.0008494001,0.0009396567,0.001006376,0.000005245055,0.00003707402,0.00003930511],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005855795,"about_ca_system_score_gemma":0.00009766258,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004308013,"about_ca_topic_score_gemma":0.001584975,"domain_scores_codex":[0.9984693,0.000007623199,0.0003008235,0.0004205992,0.0005205289,0.0002811266],"domain_scores_gemma":[0.9990032,0.00007019156,0.0001057958,0.0002196494,0.0005749266,0.00002622386],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.0001472787,0.0002766358,0.006767604,0.0003312741,0.00004872443,0.000001150258,0.0006277395,0.006531793,0.01357105,0.02707976,0.0001615186,0.9444555],"study_design_scores_gemma":[0.01797325,0.0003534495,0.6692421,0.0006609716,0.0006740236,0.000002233851,0.00386524,0.2486714,0.01127539,0.01050642,0.03441185,0.002363649],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06505918,0.00001422956,0.9292028,0.004003122,0.000134631,0.001048678,0.00007465803,0.00009189079,0.0003708033],"genre_scores_gemma":[0.9949798,0.000002180675,0.003938216,0.0006808532,0.00003007355,0.0001621702,0.0000446286,0.000006598715,0.0001555022],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9420918,"threshold_uncertainty_score":0.3607456,"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."}}