{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005164829,0.0006832923,0.0006110552,0.0005500981,0.0005070606,0.0007867417,0.001164967,0.0008958516,0.00362985],"category_scores_gemma":[0.001028238,0.0004125546,0.0009865236,0.0007814555,0.0003972154,0.001383544,0.001044302,0.001156881,0.0008129377],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004794154,"about_ca_system_score_gemma":0.00105485,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004968675,"about_ca_topic_score_gemma":0.007318606,"domain_scores_codex":[0.9996843,0.00006626294,0.00002158514,0.00005699126,0.0001371814,0.00003364707],"domain_scores_gemma":[0.9998212,0.00005591723,0.00001460431,0.00002108764,0.00007044737,0.00001664084],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00009512797,0.0001079014,0.0004771542,0.0003451681,0.0001248403,0.00009872217,0.0001548969,0.528926,0.008142227,0.05682757,0.007817183,0.3968832],"study_design_scores_gemma":[0.00001282952,0.00002396487,0.00008934159,0.00001369178,0.00001304507,0.00004378125,0.00003079508,0.9797426,0.001341137,0.013227,0.005449142,0.00001273705],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00219625,0.0002028759,0.9950119,0.00008685518,0.00005281757,0.00004277166,0.00003801572,0.000157455,0.002211109],"genre_scores_gemma":[0.06927942,0.0003680689,0.925429,0.0001079872,0.0000460785,0.0001620873,0.0001918534,0.00009472988,0.004320772],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004968675,"threshold_uncertainty_score":0.01214308,"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."}}