default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPengxiang Pan
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j12]Pengxiang Pan, Hongtao Zhu:
A strongly polynomial time approximation algorithm for the min-max clustered cycle cover problem. Theor. Comput. Sci. 1029: 115050 (2025)- 2024
- [j11]Guojun Hu
, Pengxiang Pan, Suding Liu, Ping Yang, Runtao Xie:
The prize-collecting single machine scheduling with bounds and penalties. J. Comb. Optim. 48(2): 12 (2024) - [j10]Jianping Li, Ping Yang, Junran Lichen, Pengxiang Pan:
Approximation algorithms for solving the trip-constrained vehicle routing cover problems. J. Comb. Optim. 48(3): 21 (2024) - [j9]Pengxiang Pan, Junran Lichen, Jianping Li:
Approximation algorithms for solving the vertex-traversing-constrained mixed Chinese postman problem. J. Glob. Optim. 90(4): 965-982 (2024) - [j8]Pengxiang Pan, Hongtao Zhu:
Approximation algorithms for the restricted k-Chinese postman problems with penalties. Optim. Lett. 18(1): 307-318 (2024) - [c5]Guojun Hu, Pengxiang Pan, Junran Lichen, Lijian Cai:
Algorithms for the Constrained Assignment Problems with Bounds and Maximum Penalty. AAIM (2) 2024: 27-39 - 2023
- [j7]Jianping Li, Pengxiang Pan, Junran Lichen, Lijian Cai, Wencheng Wang, Suding Liu:
Approximation algorithms for solving the heterogeneous Chinese postman problem. J. Comb. Optim. 45(1): 17 (2023) - [j6]Jianping Li, Runtao Xie, Junran Lichen, Guojun Hu, Pengxiang Pan, Ping Yang:
Exact algorithms for solving the constrained parallel-machine scheduling problems with divisible processing times and penalties. J. Comb. Optim. 45(3): 98 (2023) - [j5]Jianping Li, Lijian Cai, Junran Lichen, Pengxiang Pan:
Combinatorial algorithms for solving the constrained knapsack problems with divisible item sizes and penalties. Optim. Lett. 17(8): 1939-1956 (2023) - [j4]Junran Lichen, Lijian Cai, Jianping Li, Suding Liu, Pengxiang Pan, Wencheng Wang:
Delay-constrained minimum shortest path trees and related problems. Theor. Comput. Sci. 941: 191-201 (2023) - [c4]Pengxiang Pan, Junran Lichen, Ping Yang, Jianping Li:
The Heterogeneous Rooted Tree Cover Problem. COCOON (2) 2023: 94-105 - 2022
- [j3]Jianping Li, Wencheng Wang, Junran Lichen, Suding Liu, Pengxiang Pan:
Approximation algorithms for solving the line-capacitated minimum Steiner tree problem. J. Glob. Optim. 84(3): 687-714 (2022) - [j2]Jianping Li, Pengxiang Pan, Lijian Cai, Junran Lichen, Wencheng Wang:
Bin packing with divisible item sizes and rejection penalties. Optim. Lett. 16(5): 1587-1597 (2022) - [c3]Jianping Li, Runtao Xie, Junran Lichen, Guojun Hu, Pengxiang Pan, Ping Yang:
The Constrained Parallel-Machine Scheduling Problem with Divisible Processing Times and Penalties. AAIM 2022: 83-95 - 2021
- [j1]Hongtao Zhu, Pengxiang Pan:
The restricted Chinese postman problems with penalties. Oper. Res. Lett. 49(6): 851-854 (2021) - [c2]Jianping Li, Lijian Cai, Junran Lichen, Pengxiang Pan, Wencheng Wang, Suding Liu:
An Approximation Algorithm for Solving the Heterogeneous Chinese Postman Problem. AAIM 2021: 38-46 - [c1]Junran Lichen, Lijian Cai, Jianping Li, Suding Liu, Pengxiang Pan, Wencheng Wang:
Delay-Constrained Minimum Shortest Path Trees and Related Problems. COCOA 2021: 676-686
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-14 21:18 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
