{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007264848,0.0007753301,0.0007755902,0.0005629347,0.0006796317,0.001233602,0.001083027,0.0009327226,0.003949558],"category_scores_gemma":[0.002706188,0.0004863261,0.001076112,0.001092277,0.0004162889,0.001779765,0.0006693868,0.001164509,0.0005522565],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008130934,"about_ca_system_score_gemma":0.002078144,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007649818,"about_ca_topic_score_gemma":0.007959656,"domain_scores_codex":[0.9993978,0.0001981842,0.00003243016,0.0001757292,0.0001223696,0.00007357264],"domain_scores_gemma":[0.9989255,0.00068715,0.00008384907,0.0001308189,0.0001216381,0.00005109592],"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.0002281164,0.0004016686,0.001131865,0.0008048597,0.0001643058,0.0003385497,0.0002921548,0.8037343,0.004721657,0.02933737,0.01451204,0.1443332],"study_design_scores_gemma":[0.0001056949,0.0001750415,0.0005128505,0.00002658357,0.00004823046,0.0001701104,0.000233332,0.9540231,0.002658134,0.03358592,0.00844446,0.00001654238],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2973664,0.001121281,0.672436,0.001413384,0.0001502705,0.000740637,0.002684896,0.001984504,0.0221026],"genre_scores_gemma":[0.3374175,0.001197038,0.6466537,0.000260469,0.00006536992,0.0003850137,0.005155532,0.0002785447,0.008586869],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007649818,"threshold_uncertainty_score":0.01521057,"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."}}