{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001370266,0.0001970997,0.0002016843,0.0002897866,0.000378146,0.0002476017,0.0001797555,0.00007560564,0.000009169062],"category_scores_gemma":[0.00005385453,0.0001785417,0.000100856,0.0006984225,0.000017111,0.0002502979,0.00002834028,0.0005192371,0.00005037243],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001690821,"about_ca_system_score_gemma":0.00003810992,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001431972,"about_ca_topic_score_gemma":4.394543e-7,"domain_scores_codex":[0.9984462,0.00006671253,0.0005586537,0.000134818,0.0003255449,0.00046809],"domain_scores_gemma":[0.999275,0.0001870307,0.0001839609,0.0001353254,0.0000974736,0.0001212466],"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.00001074087,0.00001048901,0.0004901423,0.00003711562,0.00002307739,0.00001038341,0.0001510515,0.975009,0.00006490582,0.0002473245,0.00271964,0.0212261],"study_design_scores_gemma":[0.0004444748,0.00006946112,0.0007824272,0.000127897,0.000009789051,0.00009729726,0.00005200732,0.9965129,0.0002356135,0.0008762515,0.000578034,0.0002138718],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08372898,0.000025142,0.910634,0.0001920551,0.0005180903,0.0001742099,0.000001273128,0.0009077197,0.003818502],"genre_scores_gemma":[0.6859511,0.00001219794,0.3130723,0.0003871904,0.0004679784,0.000003689919,0.00005132769,0.00004112306,0.00001306738],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6022221,"threshold_uncertainty_score":0.7280718,"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."}}