{"id":"W1500616748","doi":"10.1109/tnn.2003.811562","title":"A Kohonen-like decomposition method for the euclidean traveling salesman problem - KNIES_DECOMPOSE","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Travelling salesman problem; Bottleneck traveling salesman problem; Euclidean geometry; 2-opt; Self-organizing map; Heuristic; Euclidean distance; Partition (number theory); Mathematical optimization; Computer science; Artificial neural network; Traveling purchaser problem; Mathematics; Decomposition; Algorithm; Artificial intelligence; Combinatorics","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004563865,0.0003196336,0.0002567842,0.00007404257,0.001195922,0.0003084184,0.000787288,0.0001282748,0.00002303244],"category_scores_gemma":[0.000002236986,0.0002470868,0.0003206857,0.0006935918,0.00006237945,0.0003378421,0.000004724016,0.0005426383,0.00001606245],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004978235,"about_ca_system_score_gemma":0.00002495761,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000155837,"about_ca_topic_score_gemma":0.00005920506,"domain_scores_codex":[0.9978469,0.0002228093,0.0004651958,0.0006529655,0.0002261707,0.0005859326],"domain_scores_gemma":[0.9975971,0.001233034,0.0001483575,0.0007655331,0.00009301827,0.0001629851],"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.00002631513,0.0001223406,0.00000109795,0.000006676012,0.00004435362,0.000002303385,0.00008211874,0.8607316,0.0003855381,0.006304636,0.001209545,0.1310835],"study_design_scores_gemma":[0.0005290898,0.0001654098,0.00002020691,0.00002068592,0.00005906884,0.00008859283,0.00001680622,0.98634,0.001265325,0.001819587,0.009375978,0.0002992355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0006748329,0.0001897279,0.9940377,0.002107554,0.001321589,0.001148678,0.000008914648,0.0003033466,0.0002076428],"genre_scores_gemma":[0.8598278,0.0001237121,0.1369777,0.001940268,0.0001745625,0.0005878657,0.000005126273,0.00004407698,0.0003188929],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8591529,"threshold_uncertainty_score":0.9999982,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02038063393620121,"score_gpt":0.2891594129933565,"score_spread":0.2687787790571552,"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."}}