{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001926734,0.0000884436,0.0001617028,0.0002755298,0.0001727916,0.00007132868,0.000233771,0.00008253978,0.0005222349],"category_scores_gemma":[0.0005568069,0.00009139159,0.0000515685,0.0005923336,0.0001114784,0.0002798194,0.00005329497,0.0003015815,0.0001720903],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002482605,"about_ca_system_score_gemma":0.00007099895,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003575638,"about_ca_topic_score_gemma":0.00005161855,"domain_scores_codex":[0.998519,0.0002812552,0.0003131531,0.0001460878,0.0004018738,0.0003386082],"domain_scores_gemma":[0.9985799,0.0001966521,0.000008697627,0.0003403025,0.000765957,0.0001085412],"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.000006999941,0.00003795419,0.00009162462,0.00001674434,0.0000239866,6.791924e-7,0.0002833939,0.9788033,0.00336549,0.001238263,0.006769337,0.009362206],"study_design_scores_gemma":[0.0002517535,0.00002705519,0.0005190633,0.00001506883,0.00000198107,0.000002030494,0.00005796639,0.9221447,0.0694387,0.00004525501,0.007398505,0.00009794677],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4587246,0.001586444,0.3984911,0.01097662,0.0002505415,0.001146001,0.00005302298,0.0007028516,0.1280688],"genre_scores_gemma":[0.8089427,0.0004502657,0.1888357,0.00008727252,0.0001168721,0.00003947391,0.00001501048,0.00002969931,0.001482953],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3502181,"threshold_uncertainty_score":0.5718107,"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."}}