{"id":"W2282607975","doi":"10.4230/lipics.fsttcs.2012.325","title":"k-delivery traveling salesman problem on tree networks","year":2012,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Travelling salesman problem; Pickup; Routing (electronic design automation); Vehicle routing problem; Tree (set theory); Traveling purchaser problem; Computer science; Mathematical optimization; Mathematics; Combinatorics; 2-opt; Artificial intelligence; Computer network","routes":{"ca_aff":true,"ca_fund":true,"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.0006404714,0.0005022546,0.0007662837,0.0003957038,0.0006079038,0.001017188,0.0009296723,0.0008836064,0.004489559],"category_scores_gemma":[0.002276939,0.000307339,0.0005251449,0.001200873,0.0004630424,0.002488466,0.0009137205,0.0006800366,0.0006413039],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009748501,"about_ca_system_score_gemma":0.0007267625,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002372572,"about_ca_topic_score_gemma":0.001579675,"domain_scores_codex":[0.999511,0.0001599482,0.00002836869,0.0001230559,0.00008396689,0.0000935764],"domain_scores_gemma":[0.99924,0.000509071,0.00009596371,0.00003910774,0.00006132844,0.0000544463],"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.0001939421,0.0001132171,0.0007769582,0.0004224195,0.00006836113,0.0003717425,0.0002614864,0.7635319,0.00313797,0.1605585,0.008924072,0.06163948],"study_design_scores_gemma":[0.00004083943,0.00007461129,0.0002649482,0.00001832644,0.00001784871,0.0002125624,0.0001363454,0.8957713,0.0008393123,0.09624501,0.006366952,0.00001192248],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1084725,0.001080826,0.8777491,0.0007872557,0.00008699346,0.0001512731,0.000582863,0.0002569442,0.01083228],"genre_scores_gemma":[0.6541203,0.002635152,0.3261667,0.0002803254,0.0001442544,0.0003346594,0.001455922,0.0001894318,0.01467333],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004489559,"threshold_uncertainty_score":0.01501912,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01701354244161174,"score_gpt":0.2445203401976485,"score_spread":0.2275067977560368,"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."}}