{"id":"https://openalex.org/W2003476672","doi":"https://doi.org/10.1002/net.3230090406","title":"The greedy travelling salesman's problem","display_name":"The greedy travelling salesman's problem","publication_year":1979,"publication_date":"1979-12-01","ids":{"openalex":"https://openalex.org/W2003476672","doi":"https://doi.org/10.1002/net.3230090406","mag":"2003476672"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230090406","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230090406","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5047045472","display_name":"Tom Jenkyns","orcid":null},"institutions":[{"id":"https://openalex.org/I186803428","display_name":"Brock University","ror":"https://ror.org/056am2717","country_code":"CA","type":"education","lineage":["https://openalex.org/I186803428"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"T. A. Jenkyns","raw_affiliation_strings":["Brock University St. Catharines, Ont., Canada","Brock Univ., St. Catharines, Ont., Canada#TAB#"],"affiliations":[{"raw_affiliation_string":"Brock University St. Catharines, Ont., Canada","institution_ids":["https://openalex.org/I186803428"]},{"raw_affiliation_string":"Brock Univ., St. Catharines, Ont., Canada#TAB#","institution_ids":["https://openalex.org/I186803428"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5047045472"],"corresponding_institution_ids":["https://openalex.org/I186803428"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":1.7849,"has_fulltext":false,"cited_by_count":24,"citation_normalized_percentile":{"value":0.81460408,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"9","issue":"4","first_page":"363","last_page":"373"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9954000115394592,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10948","display_name":"Advanced Combinatorial Mathematics","score":0.9954000115394592,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.8994930982589722},{"id":"https://openalex.org/keywords/digraph","display_name":"Digraph","score":0.7855826616287231},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.7035844326019287},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6966891288757324},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.6572312712669373},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.6513568162918091},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6350856423377991},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.5874455571174622},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.5344853401184082},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.470865398645401},{"id":"https://openalex.org/keywords/christofides-algorithm","display_name":"Christofides algorithm","score":0.46740084886550903},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.4510648548603058},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4129372239112854},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.405250608921051},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.34684479236602783},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2544148862361908},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.07824486494064331}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8994930982589722},{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.7855826616287231},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.7035844326019287},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6966891288757324},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.6572312712669373},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.6513568162918091},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6350856423377991},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.5874455571174622},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.5344853401184082},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.470865398645401},{"id":"https://openalex.org/C138600008","wikidata":"https://www.wikidata.org/wiki/Q498144","display_name":"Christofides algorithm","level":4,"score":0.46740084886550903},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.4510648548603058},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4129372239112854},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.405250608921051},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34684479236602783},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2544148862361908},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07824486494064331},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230090406","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230090406","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":1,"referenced_works":["https://openalex.org/W2012959686"],"related_works":["https://openalex.org/W4389782626","https://openalex.org/W4200179302","https://openalex.org/W1595757466","https://openalex.org/W2766731260","https://openalex.org/W1645834615","https://openalex.org/W2171568915","https://openalex.org/W2980689483","https://openalex.org/W3210931532","https://openalex.org/W2620231896","https://openalex.org/W2003476672"],"abstract_inverted_index":{"Abstract":[0],"The":[1,33,95],"Travelling":[2,35,106],"Salesman's":[3,36,107],"Problem":[4,37,108],"is":[5,38,67,84,91,98,112],"to":[6,114],"find":[7],"a":[8,22,27],"Hamilton":[9],"path":[10],"(or":[11,24],"circuit)":[12],"which":[13],"has":[14],"minimum":[15],"total":[16,47],"weight":[17,29,48],"W":[18,43],"*":[19,44,50,71,73,80],",":[20],"in":[21,118],"graph":[23],"digraph)":[25],"with":[26],"non\u2010negative":[28],"on":[30],"each":[31,119],"edge.":[32],"Greedy":[34,57],"\u201cHow":[39],"much":[40],"larger":[41],"than":[42],"can":[45],"the":[46,52,56,61,85,92,101,105,110],"G":[49,70],"of":[51,63,87,104],"solution":[53],"obtained":[54],"by":[55],"Algorithm":[58],"be?\u201d.":[59],"Using":[60],"theory":[62],"independence":[64],"systems,":[65],"it":[66],"shown":[68,113],"that":[69],"\u2010W":[72],"may":[74],"be":[75,115],"as":[76,78],"large":[77],"f(n,M,W":[79],")":[81],"where":[82],"n":[83],"number":[86],"vertices":[88],"and":[89,109],"M":[90],"maximum":[93],"edge\u2010weight.":[94],"function":[96],"f":[97],"determined":[99],"for":[100],"several":[102],"variations":[103],"bound":[111],"best":[116],"possible":[117],"case.":[120]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}