{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005237347,0.001108433,0.0008581124,0.0005759679,0.0005106447,0.001613428,0.001589412,0.001943699,0.007454399],"category_scores_gemma":[0.002063045,0.000521602,0.0006152138,0.001282992,0.0009461445,0.001829059,0.001304296,0.001438946,0.000559381],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001173163,"about_ca_system_score_gemma":0.0008136561,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00415195,"about_ca_topic_score_gemma":0.002871408,"domain_scores_codex":[0.9996277,0.0001291166,0.00001121947,0.000104074,0.00006439441,0.00006347381],"domain_scores_gemma":[0.9994891,0.0002803825,0.00005887213,0.00003956365,0.00005953906,0.00007252232],"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.0001406026,0.0001056836,0.0007521873,0.0002509682,0.00006384866,0.0002763949,0.0001206076,0.5356035,0.001796618,0.3942584,0.01104412,0.05558712],"study_design_scores_gemma":[0.00003397954,0.00005340707,0.0003528664,0.00003001854,0.00002690206,0.0001311582,0.0001047782,0.7867984,0.0007387363,0.2010488,0.01065811,0.00002285749],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1244328,0.001902094,0.781547,0.001998064,0.0002865304,0.0001256207,0.000721488,0.0001610757,0.0888254],"genre_scores_gemma":[0.8157703,0.002604702,0.1173525,0.000449775,0.0002644719,0.0001974462,0.0008299177,0.0002389817,0.06229183],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007454399,"threshold_uncertainty_score":0.02493745,"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."}}