{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003520801,0.001487928,0.001740547,0.001550886,0.00088917,0.004012642,0.002988352,0.002890632,0.007118055],"category_scores_gemma":[0.02616631,0.0006953355,0.00190636,0.001644313,0.002655075,0.004525771,0.002710387,0.005164301,0.0002734275],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003701616,"about_ca_system_score_gemma":0.001996296,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004778713,"about_ca_topic_score_gemma":0.002780887,"domain_scores_codex":[0.9977729,0.0008110972,0.0001078601,0.0004352677,0.0004647273,0.000408097],"domain_scores_gemma":[0.9734356,0.0231979,0.0008914292,0.0009201872,0.0008235139,0.0007312236],"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.001237493,0.000357431,0.002557919,0.0004225587,0.0001459824,0.0002246537,0.0005493594,0.6332958,0.001775921,0.3208421,0.002808403,0.0357824],"study_design_scores_gemma":[0.00006089838,0.00007459739,0.0003626571,0.00002917175,0.00003701809,0.00005399853,0.0001025504,0.8363314,0.0004653386,0.1618095,0.0006565216,0.00001630258],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.4386121,0.001715049,0.5198922,0.004421884,0.0003289114,0.000149679,0.0004107929,0.0005533771,0.033916],"genre_scores_gemma":[0.9268219,0.0005245568,0.06472361,0.000212947,0.000150864,0.0001021337,0.0004735831,0.0001246666,0.006865717],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007118055,"threshold_uncertainty_score":0.0268572,"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."}}