{"id":"W4285190221","doi":"10.1007/978-3-031-06901-7_19","title":"Improved Approximations for Capacitated Vehicle Routing with Unsplittable Client Demands","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Smart Parking Systems Research","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Vehicle routing problem; Travelling salesman problem; Rounding; Combinatorics; Approximation algorithm; Mathematics; Bounded function; Alpha (finance); Running time; Routing (electronic design automation); Algorithm; Computer science; Mathematical analysis; Statistics","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.0008164122,0.0002977917,0.0003348157,0.0004669053,0.0003399494,0.0002002863,0.0006763947,0.0001315643,0.00003340359],"category_scores_gemma":[0.00005509868,0.0002719301,0.00006088843,0.0004648201,0.0002046289,0.0001799681,0.0001873842,0.0006184563,0.000004451711],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005650962,"about_ca_system_score_gemma":0.0001920743,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003638238,"about_ca_topic_score_gemma":0.00009026106,"domain_scores_codex":[0.9978689,0.00001629662,0.0003425736,0.0006107935,0.0005552052,0.0006062114],"domain_scores_gemma":[0.9987373,0.0004029968,0.00008307899,0.0005358882,0.0001469456,0.00009373476],"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.00001455272,0.00001343446,0.000125131,0.0003132054,0.00004144436,0.00001137232,0.001082173,0.9581856,0.001765159,0.002239094,0.0000325867,0.03617627],"study_design_scores_gemma":[0.0003155478,0.0001327347,0.00002683279,0.0001834527,0.000007594967,0.00001853885,0.000001003423,0.9922933,0.001353689,0.00138754,0.003935329,0.0003444318],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001366585,0.0001501785,0.9935416,0.00005541752,0.0006729316,0.0009343614,0.00002697059,0.000236357,0.003015583],"genre_scores_gemma":[0.8925847,0.000008301023,0.1057751,0.00007956308,0.0003797355,0.0002583454,0.00004111635,0.0001316024,0.0007416092],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8912181,"threshold_uncertainty_score":0.9999733,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0186541608475317,"score_gpt":0.2393684785668184,"score_spread":0.2207143177192867,"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."}}