{"id":"W3213457727","doi":"10.48550/arxiv.2111.04536","title":"Network Migration Problem: A Logic-based Benders Decomposition Approach Driven by Column Generation and Constraint Programming","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Column generation; Constraint programming; Computer science; Upgrade; Purchasing; Mathematical optimization; Integer programming; Constraint logic programming; Node (physics); Constraint (computer-aided design); Stochastic programming; Engineering; Mathematics; Operations management; Algorithm","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.001077787,0.001238782,0.0007612054,0.0008878717,0.0006031978,0.001271914,0.001237175,0.0009811213,0.005729334],"category_scores_gemma":[0.001609724,0.0006830319,0.001396122,0.001165706,0.0006293479,0.001096247,0.001061826,0.00185443,0.0006571515],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001180975,"about_ca_system_score_gemma":0.001840431,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007159479,"about_ca_topic_score_gemma":0.008039368,"domain_scores_codex":[0.9995,0.0002036515,0.00001898899,0.00008790324,0.0001210402,0.00006837298],"domain_scores_gemma":[0.9994424,0.0003548172,0.00004972668,0.00003303945,0.00008597164,0.00003403604],"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.00003168269,0.00005470041,0.0002666703,0.00008005924,0.00002643719,0.00006407568,0.00004567976,0.9395685,0.001284887,0.02459381,0.002156276,0.03182725],"study_design_scores_gemma":[0.000008483562,0.00001327764,0.00003733825,0.000008524478,0.000005831157,0.00001301203,0.0000152207,0.9894791,0.0003568925,0.00900039,0.001057905,0.000004119724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004260621,0.00009992858,0.9921556,0.0001797398,0.0000288596,0.0000732709,0.0001183836,0.0001163942,0.00296723],"genre_scores_gemma":[0.112008,0.0002741022,0.882245,0.000207369,0.00006536334,0.0003556639,0.0004847749,0.0001526655,0.004207084],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007159479,"threshold_uncertainty_score":0.01916659,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05995537691616206,"score_gpt":0.2021079122616179,"score_spread":0.1421525353454559,"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."}}