{"id":"https://openalex.org/W4324046710","doi":"https://doi.org/10.1007/s11590-023-01992-z","title":"Approximation algorithms for the restricted k-Chinese postman problems with penalties","display_name":"Approximation algorithms for the restricted k-Chinese postman problems with penalties","publication_year":2023,"publication_date":"2023-03-13","ids":{"openalex":"https://openalex.org/W4324046710","doi":"https://doi.org/10.1007/s11590-023-01992-z"},"language":"en","primary_location":{"id":"doi:10.1007/s11590-023-01992-z","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s11590-023-01992-z","pdf_url":null,"source":{"id":"https://openalex.org/S12647387","display_name":"Optimization Letters","issn_l":"1862-4472","issn":["1862-4472","1862-4480"],"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":"Optimization Letters","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/A5038351771","display_name":"Pengxiang Pan","orcid":"https://orcid.org/0000-0001-5713-0867"},"institutions":[{"id":"https://openalex.org/I189210763","display_name":"Yunnan University","ror":"https://ror.org/0040axw97","country_code":"CN","type":"education","lineage":["https://openalex.org/I189210763"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Pengxiang Pan","raw_affiliation_strings":["School of Mathematics and Statistics, Yunnan University, Kunming, China"],"affiliations":[{"raw_affiliation_string":"School of Mathematics and Statistics, Yunnan University, Kunming, China","institution_ids":["https://openalex.org/I189210763"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086694456","display_name":"Hongtao Zhu","orcid":null},"institutions":[{"id":"https://openalex.org/I139322472","display_name":"Universiti Sains Malaysia","ror":"https://ror.org/02rgb2k63","country_code":"MY","type":"education","lineage":["https://openalex.org/I139322472"]}],"countries":["MY"],"is_corresponding":true,"raw_author_name":"Hongtao Zhu","raw_affiliation_strings":["School of Mathematical Sciences, Universiti Sains Malaysia, George Town, Pulau Pinang, Malaysia"],"affiliations":[{"raw_affiliation_string":"School of Mathematical Sciences, Universiti Sains Malaysia, George Town, Pulau Pinang, Malaysia","institution_ids":["https://openalex.org/I139322472"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5086694456"],"corresponding_institution_ids":["https://openalex.org/I139322472"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.2061,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.53559579,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"18","issue":"1","first_page":"307","last_page":"318"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9994000196456909,"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.9994000196456909,"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.9883999824523926,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9847999811172485,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8251663446426392},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6425503492355347},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5416650176048279},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.5378289818763733},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4747859835624695},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4736907482147217},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.46657952666282654},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.43282997608184814},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4237532913684845},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.4157663583755493},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.386222779750824},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32783177495002747},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.19284731149673462},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.06399574875831604}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8251663446426392},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6425503492355347},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5416650176048279},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.5378289818763733},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4747859835624695},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4736907482147217},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.46657952666282654},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.43282997608184814},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4237532913684845},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.4157663583755493},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.386222779750824},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32783177495002747},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.19284731149673462},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.06399574875831604},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s11590-023-01992-z","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s11590-023-01992-z","pdf_url":null,"source":{"id":"https://openalex.org/S12647387","display_name":"Optimization Letters","issn_l":"1862-4472","issn":["1862-4472","1862-4480"],"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":"Optimization Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10","score":0.41999998688697815}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1550550959","https://openalex.org/W1986056047","https://openalex.org/W2001139415","https://openalex.org/W2006790004","https://openalex.org/W2018139583","https://openalex.org/W2018994930","https://openalex.org/W2036924136","https://openalex.org/W2044119054","https://openalex.org/W2064284095","https://openalex.org/W2094043080","https://openalex.org/W2143987816","https://openalex.org/W3167350281","https://openalex.org/W3207929187","https://openalex.org/W4230573295","https://openalex.org/W4293179730"],"related_works":["https://openalex.org/W2995136638","https://openalex.org/W2607245078","https://openalex.org/W3206162751","https://openalex.org/W2090242643","https://openalex.org/W3099717275","https://openalex.org/W2378907459","https://openalex.org/W2064884450","https://openalex.org/W2120693270","https://openalex.org/W2951255695","https://openalex.org/W1972537263"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-01-20T17:24:06.736184","created_date":"2025-10-10T00:00:00"}