{"id":"W2027505077","doi":"10.1016/j.dam.2014.10.001","title":"The Capacitated Orienteering Problem","year":2014,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Orienteering; Mathematics; Mathematical optimization; Upper and lower bounds; Vehicle routing problem; Generalization; Subroutine; Facility location problem; Combinatorics; Euclidean geometry; Approximation algorithm; Adjacency list; Node (physics); Routing (electronic design automation); Computer science","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.0005812403,0.0001565874,0.000157171,0.00002969961,0.0001742486,0.00009156624,0.0002186776,0.00005579097,0.00001050644],"category_scores_gemma":[0.0000746375,0.0001144696,0.00003627953,0.0001978714,0.00004990098,0.0000389068,0.00003748747,0.0001498922,0.00006445272],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003097804,"about_ca_system_score_gemma":0.000004734993,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.18172e-7,"about_ca_topic_score_gemma":0.000001170611,"domain_scores_codex":[0.9991074,0.00001515903,0.0002983893,0.0001157117,0.0001778137,0.0002855888],"domain_scores_gemma":[0.9992182,0.0002748754,0.00005330403,0.000364169,0.00002956683,0.00005993934],"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.000004054892,0.00001955498,0.00001543421,0.0003975021,0.00008924567,5.035882e-7,0.003579539,0.3356393,0.01686109,0.6248662,0.001075323,0.01745228],"study_design_scores_gemma":[0.0002297509,0.000008673209,0.00001387651,0.00003245851,0.00002246704,0.000003529196,0.0004528465,0.9621022,0.007017647,0.02106137,0.008802547,0.0002525896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008329506,0.00002206761,0.891368,0.00004083757,0.0001136109,0.0002491889,0.000001899599,0.0006635857,0.09921126],"genre_scores_gemma":[0.3688009,0.00002051787,0.6307278,0.0000237251,0.00006807414,0.00008845536,0.000007058758,0.00009066817,0.0001727189],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.626463,"threshold_uncertainty_score":0.4667934,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009095838749054999,"score_gpt":0.2229178238522622,"score_spread":0.2138219851032072,"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."}}