{"id":"W384563215","doi":"10.1007/s10878-015-9905-7","title":"The Canadian Tour Operator Problem on paths: tight bounds and resource augmentation","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Travelling salesman problem; Vertex (graph theory); Operator (biology); Competitive analysis; Theory of computation; Mathematics; Graph; Path (computing); Computer science; Lin–Kernighan heuristic; Discrete mathematics; Bottleneck traveling salesman problem; Mathematical optimization; Upper and lower bounds; Algorithm","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001463059,0.00011029,0.000137858,0.0001955183,0.0004874369,0.001009572,0.0004357614,0.00008083626,0.000004921711],"category_scores_gemma":[0.0002419676,0.00007828123,0.00003443017,0.0003774146,0.00004825964,0.0007713873,0.00005205913,0.0002150424,0.000004091057],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003124518,"about_ca_system_score_gemma":0.0009207164,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003246133,"about_ca_topic_score_gemma":0.0002551927,"domain_scores_codex":[0.9983868,0.0002469119,0.0004062029,0.0001376878,0.0006081795,0.000214221],"domain_scores_gemma":[0.9982066,0.00009427901,0.0002899582,0.0001863366,0.0008076068,0.0004152525],"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.0001348469,0.0001058033,0.0002007372,0.000007715169,0.00004356723,0.00002125242,0.002518104,0.6808643,0.00001382193,0.2796562,0.02915386,0.007279711],"study_design_scores_gemma":[0.006566068,0.002698542,0.000142428,0.000112222,0.00002616998,0.00009254333,0.000344908,0.7662812,0.0002876274,0.02342141,0.199618,0.0004088206],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00521372,0.0009511709,0.8899059,0.0526108,0.01304946,0.001844331,0.000007223044,0.0001604083,0.03625696],"genre_scores_gemma":[0.6899114,0.0004243613,0.3041926,0.002335971,0.001479011,0.00003306682,0.00002370169,0.00007195354,0.001528027],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6846976,"threshold_uncertainty_score":0.9735327,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01806038807259909,"score_gpt":0.2522733273551505,"score_spread":0.2342129392825514,"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."}}