{"id":"https://openalex.org/W2059097437","doi":"https://doi.org/10.1016/0166-218x(91)90044-w","title":"Sensitivity analysis for minimum Hamiltonian path and traveling salesman problems","display_name":"Sensitivity analysis for minimum Hamiltonian path and traveling salesman problems","publication_year":1991,"publication_date":"1991-02-01","ids":{"openalex":"https://openalex.org/W2059097437","doi":"https://doi.org/10.1016/0166-218x(91)90044-w","mag":"2059097437"},"language":"en","primary_location":{"id":"doi:10.1016/0166-218x(91)90044-w","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0166-218x(91)90044-w","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/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":"government","lineage":["https://openalex.org/I99542240"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Marek Libura","raw_affiliation_strings":["Systems Research Institute, Polish Academy of Sciences, Newelska 6, 01-447 Warsaw, Poland","Systems Research Institute, Polish Academy of Sciences , Newelska 6, 01-447, Warsaw, Poland"],"affiliations":[{"raw_affiliation_string":"Systems Research Institute, Polish Academy of Sciences, Newelska 6, 01-447 Warsaw, Poland","institution_ids":["https://openalex.org/I66083562","https://openalex.org/I99542240"]},{"raw_affiliation_string":"Systems Research Institute, Polish Academy of Sciences , Newelska 6, 01-447, Warsaw, Poland","institution_ids":["https://openalex.org/I66083562","https://openalex.org/I99542240"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5071733990"],"corresponding_institution_ids":["https://openalex.org/I66083562","https://openalex.org/I99542240"],"apc_list":{"value":2750,"currency":"USD","value_usd":2750},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":55,"citation_normalized_percentile":{"value":0.23814991,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"30","issue":"2-3","first_page":"197","last_page":"211"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9965999722480774,"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.9965999722480774,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9936000108718872,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9785000085830688,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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.9011156558990479},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8195409774780273},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.8050293326377869},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.6524187326431274},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.5861390829086304},{"id":"https://openalex.org/keywords/hamiltonian","display_name":"Hamiltonian (control theory)","score":0.5624595880508423},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5391287207603455},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5305685997009277},{"id":"https://openalex.org/keywords/sensitivity","display_name":"Sensitivity (control systems)","score":0.49230945110321045},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.48852741718292236},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4574855864048004},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4492817223072052},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4471728801727295},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1207146942615509}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.9011156558990479},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8195409774780273},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.8050293326377869},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.6524187326431274},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.5861390829086304},{"id":"https://openalex.org/C130787639","wikidata":"https://www.wikidata.org/wiki/Q5645293","display_name":"Hamiltonian (control theory)","level":2,"score":0.5624595880508423},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5391287207603455},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5305685997009277},{"id":"https://openalex.org/C21200559","wikidata":"https://www.wikidata.org/wiki/Q7451068","display_name":"Sensitivity (control systems)","level":2,"score":0.49230945110321045},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.48852741718292236},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4574855864048004},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4492817223072052},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4471728801727295},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1207146942615509},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C24326235","wikidata":"https://www.wikidata.org/wiki/Q126095","display_name":"Electronic engineering","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0166-218x(91)90044-w","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0166-218x(91)90044-w","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1986022261","https://openalex.org/W2011999472","https://openalex.org/W2022363559","https://openalex.org/W2023658462","https://openalex.org/W2048500523","https://openalex.org/W2069230977","https://openalex.org/W2090839948","https://openalex.org/W2152506249","https://openalex.org/W2157128732","https://openalex.org/W2160907067","https://openalex.org/W2324108981"],"related_works":["https://openalex.org/W4365506312","https://openalex.org/W3144226417","https://openalex.org/W2043916130","https://openalex.org/W2697482356","https://openalex.org/W1507573698","https://openalex.org/W2606479096","https://openalex.org/W2040876008","https://openalex.org/W249091067","https://openalex.org/W2059097437","https://openalex.org/W3034468245"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":4},{"year":2012,"cited_by_count":2}],"updated_date":"2026-03-10T14:07:55.174380","created_date":"2025-10-10T00:00:00"}