{"id":"https://openalex.org/W1988718763","doi":"https://doi.org/10.1016/s0305-0548(98)00070-7","title":"Solving the k-best traveling salesman problem","display_name":"Solving the k-best traveling salesman problem","publication_year":1999,"publication_date":"1999-04-01","ids":{"openalex":"https://openalex.org/W1988718763","doi":"https://doi.org/10.1016/s0305-0548(98)00070-7","mag":"1988718763"},"language":"en","primary_location":{"id":"doi:10.1016/s0305-0548(98)00070-7","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0305-0548(98)00070-7","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/A5068527444","display_name":"E.S. van der Poort","orcid":null},"institutions":[{"id":"https://openalex.org/I913481162","display_name":"Wageningen University & Research","ror":"https://ror.org/04qw24q55","country_code":"NL","type":"education","lineage":["https://openalex.org/I913481162"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Edo S van der Poort","raw_affiliation_strings":["Department of Marketing & Logistics, Agrotechnological Research Institute, Wageningen, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Marketing & Logistics, Agrotechnological Research Institute, Wageningen, The Netherlands","institution_ids":["https://openalex.org/I913481162"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5071733990","display_name":"Marek Libura","orcid":null},"institutions":[{"id":"https://openalex.org/I66083562","display_name":"Systems Research Institute","ror":"https://ror.org/0111cp837","country_code":"PL","type":"facility","lineage":["https://openalex.org/I66083562","https://openalex.org/I99542240"]},{"id":"https://openalex.org/I99542240","display_name":"Polish Academy of Sciences","ror":"https://ror.org/01dr6c206","country_code":"PL","type":"funder","lineage":["https://openalex.org/I99542240"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Marek Libura","raw_affiliation_strings":["Systems Research Institute, Polish Academy of Sciences, Poland","Systems Research Institute/Polish Academy of Sciences, Poland#TAB#"],"affiliations":[{"raw_affiliation_string":"Systems Research Institute, Polish Academy of Sciences, Poland","institution_ids":["https://openalex.org/I66083562","https://openalex.org/I99542240"]},{"raw_affiliation_string":"Systems Research Institute/Polish Academy of Sciences, Poland#TAB#","institution_ids":["https://openalex.org/I99542240"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109486236","display_name":"Gerard Sierksma","orcid":null},"institutions":[{"id":"https://openalex.org/I169381384","display_name":"University of Groningen","ror":"https://ror.org/012p63287","country_code":"NL","type":"education","lineage":["https://openalex.org/I169381384"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Gerard Sierksma","raw_affiliation_strings":["Department of Econometrics, University of Groningen, The Netherlands","Department of Econometrics, University of Groningen, The Netherlands#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Econometrics, University of Groningen, The Netherlands","institution_ids":["https://openalex.org/I169381384"]},{"raw_affiliation_string":"Department of Econometrics, University of Groningen, The Netherlands#TAB#","institution_ids":["https://openalex.org/I169381384"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5001418639","display_name":"Jack A.A. van der Veen","orcid":"https://orcid.org/0000-0003-4756-3831"},"institutions":[{"id":"https://openalex.org/I870178186","display_name":"Nyenrode Business University","ror":"https://ror.org/018528593","country_code":"NL","type":"education","lineage":["https://openalex.org/I870178186"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Jack A.A van der Veen","raw_affiliation_strings":["Centre for Supply Chain Management, Nijenrode University, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Centre for Supply Chain Management, Nijenrode University, The Netherlands","institution_ids":["https://openalex.org/I870178186"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5068527444"],"corresponding_institution_ids":["https://openalex.org/I913481162"],"apc_list":{"value":3210,"currency":"USD","value_usd":3210},"apc_paid":null,"fwci":1.0901,"has_fulltext":false,"cited_by_count":38,"citation_normalized_percentile":{"value":0.77737267,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"26","issue":"4","first_page":"409","last_page":"425"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.902899980545044,"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/T12176","display_name":"Optimization and Packing Problems","score":0.902899980545044,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.8906874656677246},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5709412097930908},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5434587001800537},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.46770617365837097},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.45937761664390564},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.43452924489974976},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4344031810760498},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42410823702812195},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.4234654903411865},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.35107141733169556},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33056026697158813}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8906874656677246},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5709412097930908},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5434587001800537},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.46770617365837097},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.45937761664390564},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.43452924489974976},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4344031810760498},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42410823702812195},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.4234654903411865},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.35107141733169556},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33056026697158813},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1016/s0305-0548(98)00070-7","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0305-0548(98)00070-7","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"},{"id":"pmh:oai:pure.rug.nl:publications/bcb32e1f-ffb0-4b56-bad2-5fb939bb0be0","is_oa":false,"landing_page_url":"https://research.rug.nl/en/publications/bcb32e1f-ffb0-4b56-bad2-5fb939bb0be0","pdf_url":null,"source":{"id":"https://openalex.org/S4306400420","display_name":"University of Groningen research database (University of Groningen / Centre for Information Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I169381384","host_organization_name":"University of Groningen","host_organization_lineage":["https://openalex.org/I169381384"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"van der Poort, ES, Libura, M, Sierksma, G & van der Veen, JAA 1999, 'Solving the k-best traveling salesman problem', Computers & Operations Research, vol. 26, no. 4, pp. 409-425.","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:wur:oai:library.wur.nl:wurpubs/309256","is_oa":false,"landing_page_url":"https://research.wur.nl/en/publications/solving-the-k-best-traveling-salesman-problem","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Computers and Operations Research, 26(4), 409 - 425","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2356976268","https://openalex.org/W1997470528","https://openalex.org/W2143479842","https://openalex.org/W2495211334","https://openalex.org/W2019808372","https://openalex.org/W1991529799","https://openalex.org/W2801910904","https://openalex.org/W2095776854","https://openalex.org/W2607245078","https://openalex.org/W2061233155"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}