{"id":"W1986520459","doi":"10.1007/s10479-005-3445-y","title":"Depth-Optimized Convexity Cuts","year":2005,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"Queen's University","funders":"National Science Foundation","keywords":"Convexity; Theory of computation; Intersection (aeronautics); Mathematics; Set (abstract data type); Computation; Mathematical optimization; Integer programming; Regular polygon; Function (biology); Order (exchange); Convex function; Integer (computer science); Linear programming; Algorithm; Computer science; Geometry","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.002252569,0.002390728,0.002593501,0.002341047,0.001085957,0.002871601,0.002475744,0.0026824,0.01613756],"category_scores_gemma":[0.008727759,0.002188838,0.001930411,0.002464958,0.0016897,0.004187279,0.003302672,0.005651671,0.001953075],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002488246,"about_ca_system_score_gemma":0.002252432,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003445514,"about_ca_topic_score_gemma":0.004394418,"domain_scores_codex":[0.9986835,0.0004545066,0.00004746599,0.0002366442,0.0004019178,0.0001759382],"domain_scores_gemma":[0.9973722,0.001650716,0.0001711081,0.000288434,0.0003665309,0.0001510179],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004151817,0.0002052023,0.0006236802,0.000336756,0.00008910687,0.00009670864,0.0001504761,0.4604624,0.003080212,0.2976531,0.02902405,0.2078631],"study_design_scores_gemma":[0.00006177187,0.0000885878,0.0002710071,0.00007913027,0.00003828106,0.00006702704,0.00004263916,0.7873433,0.001526503,0.2023715,0.008089173,0.00002098047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01084192,0.0007623655,0.96626,0.0005633207,0.0001599472,0.0001481237,0.0004229089,0.0003883887,0.0204531],"genre_scores_gemma":[0.1971876,0.001450079,0.7669081,0.0004293724,0.0002552803,0.0005328059,0.001367592,0.001006517,0.03086265],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01613756,"threshold_uncertainty_score":0.05398554,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2467614375484764,"score_gpt":0.4702200630803455,"score_spread":0.223458625531869,"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."}}