{"id":"W1601856531","doi":"10.1007/s00453-002-0986-1","title":"TSP Heuristics: Domination Analysis and Complexity","year":2002,"lang":"en","type":"article","venue":"Algorithmica","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":60,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Combinatorics; Travelling salesman problem; Mathematics; Heuristics; Digraph; Heuristic; Theory of computation; Time complexity; Constant (computer programming); Discrete mathematics; Graph; Mathematical optimization; Algorithm; Computer science","routes":{"ca_aff":true,"ca_fund":false,"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.00341419,0.001170654,0.001528019,0.002822939,0.001328041,0.003997883,0.002146292,0.001994829,0.007341682],"category_scores_gemma":[0.02223738,0.00100476,0.001306462,0.004558725,0.002852241,0.007335486,0.001616731,0.003590696,0.0005366036],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004260925,"about_ca_system_score_gemma":0.002363321,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006740001,"about_ca_topic_score_gemma":0.007844958,"domain_scores_codex":[0.9980012,0.0008909208,0.000053347,0.0002035256,0.0006455988,0.0002054427],"domain_scores_gemma":[0.9819953,0.01572944,0.0005562911,0.0007177797,0.0007911029,0.0002100677],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001597548,0.0001863782,0.001525928,0.0003696778,0.0001073796,0.00007841202,0.00033998,0.4331452,0.0007275761,0.468238,0.01466145,0.08046036],"study_design_scores_gemma":[0.00002944624,0.00002430549,0.0005347524,0.00004999191,0.00003599656,0.00006015884,0.00006990751,0.6414059,0.0002893598,0.353767,0.003716671,0.0000163672],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06623892,0.01839283,0.8574783,0.00501128,0.000296959,0.0001703615,0.0004585147,0.0003867912,0.05156603],"genre_scores_gemma":[0.7752115,0.01461321,0.1854819,0.0006168673,0.001389439,0.000409844,0.0006955166,0.0004235981,0.02115822],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007341682,"threshold_uncertainty_score":0.03091532,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02925142421986513,"score_gpt":0.2506017387149126,"score_spread":0.2213503144950475,"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."}}