{"id":"W2734889840","doi":"10.1287/ijoc.2017.0747","title":"Numerically Safe Lower Bounds for the Capacitated Vehicle Routing Problem","year":2017,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematical optimization; Branch and cut; Pruning; Branch and bound; Heuristic; Mathematics; Linear programming relaxation; Integer programming; Steiner tree problem; Linear programming; Routing (electronic design automation); Upper and lower bounds; Function (biology); Integer (computer science); Key (lock); Vehicle routing problem; Dual (grammatical number); Computer science","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.007686043,0.0035161,0.001331664,0.003413605,0.001384269,0.005373914,0.00294259,0.002121323,0.0123991],"category_scores_gemma":[0.04520022,0.0009311443,0.002167487,0.00240467,0.003252205,0.005707631,0.004390564,0.009279273,0.003703016],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003448014,"about_ca_system_score_gemma":0.003535006,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002218488,"about_ca_topic_score_gemma":0.003664394,"domain_scores_codex":[0.9946439,0.001761877,0.000239959,0.0005499347,0.002259952,0.0005443124],"domain_scores_gemma":[0.9719453,0.02207624,0.001304395,0.002126115,0.002077854,0.0004701524],"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.0001416309,0.0001239051,0.0006543234,0.0005065805,0.00006969923,0.0001975148,0.00023478,0.4596149,0.003873435,0.4519672,0.008192864,0.07442302],"study_design_scores_gemma":[0.00001995572,0.00006083216,0.0001565513,0.0002342328,0.00002964644,0.00008495981,0.00004890543,0.667316,0.002823006,0.3176561,0.01153999,0.00002979831],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002577439,0.001289787,0.9776618,0.0008300674,0.0001822562,0.00007966956,0.0001751571,0.0002991798,0.01690459],"genre_scores_gemma":[0.2031328,0.005175292,0.7753236,0.001004398,0.0006969637,0.001068436,0.00118235,0.001266385,0.01114982],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0123991,"threshold_uncertainty_score":0.04147917,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02471797659407317,"score_gpt":0.2872649552065073,"score_spread":0.2625469786124341,"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."}}