{"id":"https://openalex.org/W2787763202","doi":"https://doi.org/10.1007/s10957-018-1221-9","title":"An Algorithm for Solving the Shortest Path Improvement Problem on Rooted Trees Under Unit Hamming Distance","display_name":"An Algorithm for Solving the Shortest Path Improvement Problem on Rooted Trees Under Unit Hamming Distance","publication_year":2018,"publication_date":"2018-01-29","ids":{"openalex":"https://openalex.org/W2787763202","doi":"https://doi.org/10.1007/s10957-018-1221-9","mag":"2787763202"},"language":"en","primary_location":{"id":"doi:10.1007/s10957-018-1221-9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10957-018-1221-9","pdf_url":null,"source":{"id":"https://openalex.org/S52430896","display_name":"Journal of Optimization Theory and Applications","issn_l":"0022-3239","issn":["0022-3239","1573-2878"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Optimization Theory and Applications","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/A5030694645","display_name":"Binwu Zhang","orcid":"https://orcid.org/0000-0002-9936-3172"},"institutions":[{"id":"https://openalex.org/I163340411","display_name":"Hohai University","ror":"https://ror.org/01wd4xt90","country_code":"CN","type":"education","lineage":["https://openalex.org/I163340411"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Binwu Zhang","raw_affiliation_strings":["Department of Mathematics and Physics, Hohai University, Changzhou Campus, Changzhou, 213022, China"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Physics, Hohai University, Changzhou Campus, Changzhou, 213022, China","institution_ids":["https://openalex.org/I163340411"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5029199312","display_name":"Xiucui Guan","orcid":"https://orcid.org/0000-0002-2653-1868"},"institutions":[{"id":"https://openalex.org/I76569877","display_name":"Southeast University","ror":"https://ror.org/04ct4d772","country_code":"CN","type":"education","lineage":["https://openalex.org/I76569877"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Xiucui Guan","raw_affiliation_strings":["School of Mathematics, Southeast University, Nanjing, 210096, China"],"affiliations":[{"raw_affiliation_string":"School of Mathematics, Southeast University, Nanjing, 210096, China","institution_ids":["https://openalex.org/I76569877"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050062467","display_name":"P\u00e3nos M. Pardalos","orcid":"https://orcid.org/0000-0001-9623-8053"},"institutions":[{"id":"https://openalex.org/I4210089412","display_name":"Applied Optimization (United States)","ror":"https://ror.org/004b0n253","country_code":"US","type":"company","lineage":["https://openalex.org/I4210089412"]},{"id":"https://openalex.org/I118501908","display_name":"National Research University Higher School of Economics","ror":"https://ror.org/055f7t516","country_code":"RU","type":"education","lineage":["https://openalex.org/I118501908"]},{"id":"https://openalex.org/I33213144","display_name":"University of Florida","ror":"https://ror.org/02y3ad647","country_code":"US","type":"education","lineage":["https://openalex.org/I33213144"]}],"countries":["RU","US"],"is_corresponding":false,"raw_author_name":"Panos M. Pardalos","raw_affiliation_strings":["Department of Industrial and Systems Engineering, Center for Applied Optimization, University of Florida, Gainesville, FL, USA","LATNA, Higher School of Economics, Moscow, Russia"],"affiliations":[{"raw_affiliation_string":"Department of Industrial and Systems Engineering, Center for Applied Optimization, University of Florida, Gainesville, FL, USA","institution_ids":["https://openalex.org/I4210089412","https://openalex.org/I33213144"]},{"raw_affiliation_string":"LATNA, Higher School of Economics, Moscow, Russia","institution_ids":["https://openalex.org/I118501908"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5010580317","display_name":"Chunyuan He","orcid":null},"institutions":[{"id":"https://openalex.org/I163340411","display_name":"Hohai University","ror":"https://ror.org/01wd4xt90","country_code":"CN","type":"education","lineage":["https://openalex.org/I163340411"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Chunyuan He","raw_affiliation_strings":["Department of Mathematics and Physics, Hohai University, Changzhou Campus, Changzhou, 213022, China"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Physics, Hohai University, Changzhou Campus, Changzhou, 213022, China","institution_ids":["https://openalex.org/I163340411"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5029199312"],"corresponding_institution_ids":["https://openalex.org/I76569877"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":1.0069,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.80464987,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"178","issue":"2","first_page":"538","last_page":"559"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9970999956130981,"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.9970999956130981,"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/T11606","display_name":"Infrastructure Maintenance and Monitoring","score":0.9883000254631042,"subfield":{"id":"https://openalex.org/subfields/2205","display_name":"Civil and Structural 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.9830999970436096,"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/shortest-path-problem","display_name":"Shortest path problem","score":0.7898648381233215},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.7736740708351135},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.6215155720710754},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6154842376708984},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.5912669897079468},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.5305616855621338},{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.5290409922599792},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5058026313781738},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.49046847224235535},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.47022199630737305},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.4623798727989197},{"id":"https://openalex.org/keywords/widest-path-problem","display_name":"Widest path problem","score":0.4496763050556183},{"id":"https://openalex.org/keywords/hamming-graph","display_name":"Hamming graph","score":0.447654128074646},{"id":"https://openalex.org/keywords/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.4246908724308014},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4147277772426605},{"id":"https://openalex.org/keywords/hamming-code","display_name":"Hamming code","score":0.37034058570861816},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.35073620080947876},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.3326065242290497},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2732398211956024},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.2417626976966858}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7898648381233215},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.7736740708351135},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.6215155720710754},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6154842376708984},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.5912669897079468},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.5305616855621338},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.5290409922599792},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5058026313781738},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.49046847224235535},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.47022199630737305},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.4623798727989197},{"id":"https://openalex.org/C83677490","wikidata":"https://www.wikidata.org/wiki/Q7998708","display_name":"Widest path problem","level":5,"score":0.4496763050556183},{"id":"https://openalex.org/C29696283","wikidata":"https://www.wikidata.org/wiki/Q369440","display_name":"Hamming graph","level":5,"score":0.447654128074646},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.4246908724308014},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4147277772426605},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.37034058570861816},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.35073620080947876},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.3326065242290497},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2732398211956024},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2417626976966858},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.0},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s10957-018-1221-9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10957-018-1221-9","pdf_url":null,"source":{"id":"https://openalex.org/S52430896","display_name":"Journal of Optimization Theory and Applications","issn_l":"0022-3239","issn":["0022-3239","1573-2878"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Optimization Theory and Applications","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:spr:joptap:v:178:y:2018:i:2:d:10.1007_s10957-018-1221-9","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10957-018-1221-9","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4487875803","display_name":null,"funder_award_id":"2015B27914","funder_id":"https://openalex.org/F4320334997","funder_display_name":"Chinese Universities Scientific Fund"},{"id":"https://openalex.org/G5043217510","display_name":null,"funder_award_id":"11471073","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"},{"id":"https://openalex.org/F4320324099","display_name":"Russian Science Foundation","ror":"https://ror.org/03y2gwe85"},{"id":"https://openalex.org/F4320324261","display_name":"National Research University Higher School of Economics","ror":"https://ror.org/055f7t516"},{"id":"https://openalex.org/F4320334997","display_name":"Chinese Universities Scientific Fund","ror":null}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1577976795","https://openalex.org/W1966229055","https://openalex.org/W1979134936","https://openalex.org/W1993675440","https://openalex.org/W2016702464","https://openalex.org/W2021388365","https://openalex.org/W2044926776","https://openalex.org/W2046532265","https://openalex.org/W2082122685","https://openalex.org/W2091611196","https://openalex.org/W2129343799","https://openalex.org/W2154242276","https://openalex.org/W2166042729","https://openalex.org/W2734739073"],"related_works":["https://openalex.org/W2156431668","https://openalex.org/W2018146256","https://openalex.org/W2375775343","https://openalex.org/W2198982833","https://openalex.org/W4200172719","https://openalex.org/W2365712669","https://openalex.org/W2360981904","https://openalex.org/W2112429204","https://openalex.org/W2612665926","https://openalex.org/W4294360851"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}