{"id":"https://openalex.org/W2090944138","doi":"https://doi.org/10.1016/0305-0548(90)90034-5","title":"Fictitious upper bounds in an algorithm for the symmetric traveling salesman problem","display_name":"Fictitious upper bounds in an algorithm for the symmetric traveling salesman problem","publication_year":1990,"publication_date":"1990-01-01","ids":{"openalex":"https://openalex.org/W2090944138","doi":"https://doi.org/10.1016/0305-0548(90)90034-5","mag":"2090944138"},"language":"en","primary_location":{"id":"doi:10.1016/0305-0548(90)90034-5","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0305-0548(90)90034-5","pdf_url":null,"source":{"id":"https://openalex.org/S173256270","display_name":"Computers & Operations Research","issn_l":"0305-0548","issn":["0305-0548","1873-765X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computers & Operations Research","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/A5009361554","display_name":"Ton Volgenant","orcid":null},"institutions":[{"id":"https://openalex.org/I887064364","display_name":"University of Amsterdam","ror":"https://ror.org/04dkp9463","country_code":"NL","type":"education","lineage":["https://openalex.org/I887064364"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Ton Volgenant","raw_affiliation_strings":["Department of Operations Research, Institute of Actuarial Sciences and Econometrics. University of Amsterdam, 1011 NH Amsterdam, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Operations Research, Institute of Actuarial Sciences and Econometrics. University of Amsterdam, 1011 NH Amsterdam, The Netherlands","institution_ids":["https://openalex.org/I887064364"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112242799","display_name":"Roy Jonker","orcid":null},"institutions":[{"id":"https://openalex.org/I887064364","display_name":"University of Amsterdam","ror":"https://ror.org/04dkp9463","country_code":"NL","type":"education","lineage":["https://openalex.org/I887064364"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Roy Jonker","raw_affiliation_strings":["Department of Operations Research, Institute of Actuarial Sciences and Econometrics. University of Amsterdam, 1011 NH Amsterdam, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Operations Research, Institute of Actuarial Sciences and Econometrics. University of Amsterdam, 1011 NH Amsterdam, The Netherlands","institution_ids":["https://openalex.org/I887064364"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5009361554"],"corresponding_institution_ids":["https://openalex.org/I887064364"],"apc_list":{"value":3210,"currency":"USD","value_usd":3210},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.29486301,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"17","issue":"1","first_page":"113","last_page":"117"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9958000183105469,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"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.8804025053977966},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.8279874324798584},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6217618584632874},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6188117265701294},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.6050814390182495},{"id":"https://openalex.org/keywords/traveling-purchaser-problem","display_name":"Traveling purchaser problem","score":0.5516612529754639},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5465951561927795},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5288385152816772},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.4992849826812744},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4603971838951111},{"id":"https://openalex.org/keywords/lin\u2013kernighan-heuristic","display_name":"Lin\u2013Kernighan heuristic","score":0.447065144777298},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4271136522293091},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.07448777556419373}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8804025053977966},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.8279874324798584},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6217618584632874},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6188117265701294},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.6050814390182495},{"id":"https://openalex.org/C4331618","wikidata":"https://www.wikidata.org/wiki/Q7836034","display_name":"Traveling purchaser problem","level":4,"score":0.5516612529754639},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5465951561927795},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5288385152816772},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.4992849826812744},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4603971838951111},{"id":"https://openalex.org/C103888782","wikidata":"https://www.wikidata.org/wiki/Q2835802","display_name":"Lin\u2013Kernighan heuristic","level":4,"score":0.447065144777298},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4271136522293091},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07448777556419373},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0305-0548(90)90034-5","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0305-0548(90)90034-5","pdf_url":null,"source":{"id":"https://openalex.org/S173256270","display_name":"Computers & Operations Research","issn_l":"0305-0548","issn":["0305-0548","1873-765X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computers & Operations Research","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.6299999952316284,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W2001094832","https://openalex.org/W2009803313","https://openalex.org/W2015297268","https://openalex.org/W2032527321","https://openalex.org/W2044347866","https://openalex.org/W2054825183","https://openalex.org/W2066558813","https://openalex.org/W2081232059","https://openalex.org/W2144931885"],"related_works":["https://openalex.org/W4389782626","https://openalex.org/W2171568915","https://openalex.org/W2167244338","https://openalex.org/W4376138746","https://openalex.org/W1595757466","https://openalex.org/W2191054341","https://openalex.org/W4246557197","https://openalex.org/W2362402143","https://openalex.org/W4220987199","https://openalex.org/W2359992618"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}