{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00332306,0.003046068,0.003572946,0.002805399,0.003199559,0.006305706,0.006468719,0.003417456,0.02932077],"category_scores_gemma":[0.02289609,0.001333961,0.00179802,0.007998151,0.00385848,0.01050567,0.004722323,0.007362281,0.001439444],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.01169888,"about_ca_system_score_gemma":0.01578891,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.1308047,"about_ca_topic_score_gemma":0.1698887,"domain_scores_codex":[0.9962501,0.001009014,0.00008688758,0.0005257145,0.0009210191,0.001207225],"domain_scores_gemma":[0.9865924,0.009085083,0.0005147997,0.0009022725,0.001343411,0.001562156],"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.0007372593,0.0004244532,0.0009318654,0.0006035287,0.0001061382,0.0002030886,0.0003047328,0.5205485,0.00118664,0.3782037,0.05065291,0.04609724],"study_design_scores_gemma":[0.00009594771,0.0001064957,0.0004561991,0.0001334893,0.00006889481,0.0001102619,0.0002488138,0.7255249,0.0005254506,0.261945,0.01073007,0.00005457508],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1390231,0.006972745,0.6014255,0.01583852,0.001110592,0.001336456,0.008198463,0.001155523,0.2249392],"genre_scores_gemma":[0.7044997,0.006831481,0.2185875,0.001790562,0.0008138451,0.001004574,0.004500021,0.001088698,0.0608835],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.1308047,"threshold_uncertainty_score":0.2600867,"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."}}