{"id":"W2065185671","doi":"10.1016/j.endm.2013.05.133","title":"On the approximability of two capacitated vehicle routing problems","year":2013,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Orienteering; Regret; Vehicle routing problem; Mathematics; Euclidean geometry; Mathematical optimization; Chen; Combinatorics; Euclidean distance; Approximation algorithm; Discrete mathematics; Computer science; Routing (electronic design automation)","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.001641637,0.0001747201,0.0002497526,0.00009665695,0.00009689821,0.00007898638,0.001276785,0.00004361198,0.00004437071],"category_scores_gemma":[0.001131449,0.0001132489,0.0000763459,0.0007928454,0.000229632,0.0002855293,0.0002599995,0.0005040545,0.00004510358],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000135224,"about_ca_system_score_gemma":0.00008190373,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005188217,"about_ca_topic_score_gemma":0.00002739192,"domain_scores_codex":[0.9978693,0.0002322315,0.0004553606,0.0003225304,0.0004224432,0.0006981333],"domain_scores_gemma":[0.9963723,0.002228395,0.0001846873,0.001068064,0.00009944857,0.00004705838],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000002860262,0.0001212095,0.000178963,0.00005674978,0.00001408349,4.045881e-7,0.001781095,0.001313325,0.007403216,0.9874629,0.000005531761,0.001659602],"study_design_scores_gemma":[0.0002010192,0.000101959,0.00006945982,0.00005791095,0.000001560953,0.0000017798,0.00006307955,0.2692403,0.01503592,0.7151288,0.000001685588,0.00009650505],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6243078,0.00005418511,0.3730654,0.0007511979,0.00001785128,0.0008165954,0.000001063921,0.00006311529,0.0009228604],"genre_scores_gemma":[0.9829362,0.000004537199,0.01681917,0.000042952,0.000007548917,0.0001342316,7.566504e-7,0.00001697931,0.00003760857],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3586285,"threshold_uncertainty_score":0.4618157,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02151688624129685,"score_gpt":0.2811482681370374,"score_spread":0.2596313818957406,"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."}}