{"id":"W4361003883","doi":"10.1287/ijoc.2023.1280","title":"Network Migration Problem: A Hybrid Logic-Based Benders Decomposition Approach","year":2023,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"Ciena (Canada); HEC Montréal","funders":"","keywords":"Computer science; Constraint programming; Column generation; Upgrade; Purchasing; Mathematical optimization; Integer programming; Node (physics); Decomposition; Process (computing); Stochastic programming; Engineering; Mathematics; Algorithm; Operations management","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true,"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.001425614,0.001486545,0.001005861,0.001174692,0.0007573225,0.001736308,0.001564022,0.001437042,0.007594728],"category_scores_gemma":[0.00194555,0.0008263423,0.001860677,0.001237504,0.0006676236,0.001536986,0.001289253,0.002121632,0.0008923626],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001565887,"about_ca_system_score_gemma":0.002034466,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006130374,"about_ca_topic_score_gemma":0.007691056,"domain_scores_codex":[0.999252,0.0002822537,0.00003289192,0.0001386751,0.0001832071,0.0001109405],"domain_scores_gemma":[0.9993617,0.0004106567,0.00005819303,0.00003421136,0.0000940445,0.00004129917],"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.00004017402,0.0000664808,0.0003555755,0.0001116912,0.00003291901,0.00007797612,0.00005864225,0.9377523,0.001231293,0.02672974,0.002497692,0.0310454],"study_design_scores_gemma":[0.00001207326,0.00002145756,0.00006046634,0.00001704959,0.000009877836,0.00002402477,0.00002825693,0.9830132,0.0003191314,0.01468446,0.001803748,0.000006275484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005507229,0.0002230067,0.9876972,0.00034976,0.00004795341,0.0001171785,0.0001778062,0.0001354503,0.005744518],"genre_scores_gemma":[0.1267236,0.0005565828,0.8634573,0.0003294007,0.0001013978,0.0004374201,0.0006143493,0.0001888177,0.007591174],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007594728,"threshold_uncertainty_score":0.0254069,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02840020940847707,"score_gpt":0.2788438215552102,"score_spread":0.2504436121467332,"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."}}