{"id":"W6996630002","doi":"","title":"Solving Traveling Salesman Problem With a non-complete Graph","year":2010,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"University of Waterloo","keywords":"Travelling salesman problem; Graph; Set (abstract data type); Complete graph; Obstacle; 2-opt; Christofides algorithm; Shortest path problem","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002063508,0.0003268184,0.0004676329,0.0003241774,0.0002014159,0.00003393913,0.0003735603,0.0004024067,0.00009774569],"category_scores_gemma":[0.000006110942,0.0003846913,0.0001307464,0.0003279328,0.00006178521,0.0001984984,0.00002519086,0.0006515458,0.00001956197],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005048742,"about_ca_system_score_gemma":0.00005188533,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002916891,"about_ca_topic_score_gemma":0.02547678,"domain_scores_codex":[0.9988604,0.0000360471,0.0001632478,0.0003318116,0.0002618572,0.0003465918],"domain_scores_gemma":[0.9991711,0.00003870182,0.0001753763,0.0003307977,0.0001747809,0.0001092947],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003248724,0.0001102479,0.001485011,0.004851001,0.001014146,0.0001506047,0.453103,0.2997685,0.2232081,0.0002526798,0.0007923021,0.0149395],"study_design_scores_gemma":[0.008244163,0.0007453162,0.02858487,0.006223345,0.00234369,0.00007620532,0.3176813,0.5894529,0.03747597,0.0006720443,0.002000318,0.006499842],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.9850427,0.00003674534,0.01133056,0.00005490636,0.0002713845,0.0003613064,0.00002439239,0.0003521401,0.002525883],"genre_scores_gemma":[0.2030738,0.0001358902,0.6942936,0.000008136421,0.0001006212,0.000002120689,0.0008474694,0.0002576151,0.1012807],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7819688,"threshold_uncertainty_score":0.9998605,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008591879861394194,"score_gpt":0.194236627860805,"score_spread":0.1856447479994108,"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."}}