{"id":"https://openalex.org/W2132287256","doi":"https://doi.org/10.1016/0166-218x(93)90152-e","title":"An O(n) algorithm to solve the Bottleneck Traveling Salesman Problem restricted to ordered product matrices","display_name":"An O(n) algorithm to solve the Bottleneck Traveling Salesman Problem restricted to ordered product matrices","publication_year":1993,"publication_date":"1993-11-01","ids":{"openalex":"https://openalex.org/W2132287256","doi":"https://doi.org/10.1016/0166-218x(93)90152-e","mag":"2132287256"},"language":"en","primary_location":{"id":"doi:10.1016/0166-218x(93)90152-e","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0166-218x(93)90152-e","pdf_url":null,"source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"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":"Discrete Applied Mathematics","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/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":true,"raw_author_name":"Jack A.A. van der Veen","raw_affiliation_strings":["Department of Quantitative Methods, Nijenrode, The Netherlands School of Business, Straatweg 25, 3621 BG Breukelen, Netherlands#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Quantitative Methods, Nijenrode, The Netherlands School of Business, Straatweg 25, 3621 BG Breukelen, Netherlands#TAB#","institution_ids":["https://openalex.org/I870178186"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5001418639"],"corresponding_institution_ids":["https://openalex.org/I870178186"],"apc_list":{"value":2750,"currency":"USD","value_usd":2750},"apc_paid":null,"fwci":0.5824,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.69687901,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"47","issue":"1","first_page":"57","last_page":"75"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T12176","display_name":"Optimization and Packing Problems","score":0.994700014591217,"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/T12288","display_name":"Optimization and Search Problems","score":0.9886999726295471,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9152656197547913},{"id":"https://openalex.org/keywords/bottleneck","display_name":"Bottleneck","score":0.7555959224700928},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6947192549705505},{"id":"https://openalex.org/keywords/product","display_name":"Product (mathematics)","score":0.6400507688522339},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5336739420890808},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5117156505584717},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.4669329524040222},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.36066386103630066},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.21485385298728943}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.9152656197547913},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.7555959224700928},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6947192549705505},{"id":"https://openalex.org/C90673727","wikidata":"https://www.wikidata.org/wiki/Q901718","display_name":"Product (mathematics)","level":2,"score":0.6400507688522339},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5336739420890808},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5117156505584717},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.4669329524040222},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.36066386103630066},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.21485385298728943},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/0166-218x(93)90152-e","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0166-218x(93)90152-e","pdf_url":null,"source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"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":"Discrete Applied Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:pure.rug.nl:openaire_cris_publications/c7298d67-db4b-4fc5-a044-76b70df362fe","is_oa":false,"landing_page_url":"https://research.rug.nl/en/publications/c7298d67-db4b-4fc5-a044-76b70df362fe","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":"VANDERVEEN, JAA 1993, 'AN O(N) ALGORITHM TO SOLVE THE BOTTLENECK TRAVELING SALESMAN PROBLEM RESTRICTED TO ORDERED PRODUCT MATRICES', Discrete Applied Mathematics, vol. 47, no. 1, pp. 57-75.","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W249091067","https://openalex.org/W1970388956","https://openalex.org/W1971327934","https://openalex.org/W1988114663","https://openalex.org/W2017932090","https://openalex.org/W2041758482","https://openalex.org/W2044060832","https://openalex.org/W2151811408","https://openalex.org/W2251392383","https://openalex.org/W4244086314","https://openalex.org/W4285719527","https://openalex.org/W6604664341"],"related_works":["https://openalex.org/W4376138746","https://openalex.org/W2361554335","https://openalex.org/W2171568915","https://openalex.org/W1595757466","https://openalex.org/W2359992618","https://openalex.org/W4200179302","https://openalex.org/W4309336419","https://openalex.org/W2620231896","https://openalex.org/W2946024655","https://openalex.org/W2265604726"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}