{"id":"W3213766502","doi":"10.1287/moor.2022.0097","title":"Improved Approximations for a CVRP with Unsplittable Demands","year":2025,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Combinatorics; Rounding; Approximation algorithm; Vehicle routing problem; Travelling salesman problem; Bounded function; Alpha (finance); Running time; Algorithm; Routing (electronic design automation); Computer science; Mathematical analysis; Statistics","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true,"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.00120959,0.0001009366,0.0001754283,0.000645262,0.0004655619,0.0003486017,0.0003113195,0.00003944559,0.0001717213],"category_scores_gemma":[0.0003421896,0.00008022051,0.00004866485,0.00099169,0.0001165166,0.0004696694,0.0001613052,0.00009953846,0.00002545227],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003820214,"about_ca_system_score_gemma":0.00007819218,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000133036,"about_ca_topic_score_gemma":0.0002074406,"domain_scores_codex":[0.9989383,0.00001067962,0.0003074423,0.0001901309,0.0002861833,0.0002672308],"domain_scores_gemma":[0.9985939,0.0001227514,0.00003792953,0.0003873302,0.0008485889,0.000009538948],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002226238,0.0004022924,0.0001075826,0.001823129,0.00007204718,2.73548e-7,0.0001685059,0.001646171,0.0013266,0.9842526,0.009651791,0.0005267746],"study_design_scores_gemma":[0.001103912,0.0000510366,0.00005940271,0.0002163107,0.00005665343,2.797764e-7,0.003008592,0.918227,0.001402292,0.02723679,0.04847831,0.0001594705],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07558361,0.0001333715,0.6416728,0.007199781,0.0001960255,0.005832823,0.00002439894,0.0001670833,0.2691901],"genre_scores_gemma":[0.8798604,0.00001020422,0.07597057,0.0003895405,0.0002244204,0.002064634,0.0001052935,0.00004242469,0.04133248],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9570158,"threshold_uncertainty_score":0.3580773,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06807445142131156,"score_gpt":0.3463268094997864,"score_spread":0.2782523580784749,"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."}}