{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003178496,0.0003152617,0.0003150797,0.0001129915,0.000189566,0.0002343861,0.000158808,0.0004091949,0.00001337467],"category_scores_gemma":[0.0000168653,0.0004326574,0.00009464085,0.000377577,0.00009786184,0.0001684684,0.0001201986,0.0004593038,0.000001050137],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002869792,"about_ca_system_score_gemma":0.00009062019,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005379886,"about_ca_topic_score_gemma":0.00008297968,"domain_scores_codex":[0.9983779,0.0002763328,0.0002656208,0.0006809446,0.00008323516,0.0003159191],"domain_scores_gemma":[0.9992075,0.00006031893,0.0001595035,0.0003021233,0.0001455852,0.0001249677],"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.000007762822,0.00004817902,0.002042658,0.0002015706,0.00008182794,0.00001408311,0.0001286787,0.9944539,0.0006959319,0.001192609,0.0002585836,0.0008742062],"study_design_scores_gemma":[0.0004357151,0.00002878911,0.0001114769,0.00009426546,0.0001340086,0.000004595347,0.0001734674,0.9979863,0.0002358693,0.0003298002,0.000052449,0.0004132397],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1720016,0.0001515102,0.826363,0.00003764938,0.000143344,0.0006247818,0.00001522036,0.0003753259,0.0002876019],"genre_scores_gemma":[0.7300069,0.00008163799,0.2687108,0.00003979711,0.00007176934,0.000008905024,0.001022878,0.00003584773,0.00002148072],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5580053,"threshold_uncertainty_score":0.9998125,"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."}}