Остановите войну!
for scientists:
default search action
Weidong Li 0002
- > Home > Persons > Weidong Li 0002
Publications
- 2019
- [j21]Li Guan, Jianping Li, Weidong Li, Junran Lichen:
Improved approximation algorithms for the combination problem of parallel machine scheduling and path. J. Comb. Optim. 38(3): 689-697 (2019) - 2018
- [c15]Bingfei Dai, Jianping Li, Weidong Li:
Semi-online Hierarchical Scheduling for Bag-of-tasks on Two Machines. CSAI/ICIMT 2018: 609-614 - 2017
- [c12]Jianping Li, Xiaofei Liu, Weidong Li, Li Guan, Junran Lichen:
Approximation Algorithms for the Generalized Stacker Crane Problem. COCOA (1) 2017: 95-102 - 2016
- [j14]Jianping Li, Li Guan, Honglin Ding, Weidong Li:
Approximations for constructing tree-form structures using specific material with fixed length. Optim. Lett. 10(6): 1337-1345 (2016) - [j13]Weidong Li, Jianping Li, Li Guan, Yaomin Shi:
The Prize-collecting Call Control Problem on Weighted Lines and Rings. RAIRO Oper. Res. 50(1): 39-46 (2016) - 2015
- [j11]Weidong Li, Jianping Li, Xuejie Zhang, Zhibin Chen:
Penalty cost constrained identical parallel machine scheduling problem. Theor. Comput. Sci. 607: 181-192 (2015) - [c5]Li Guan, Jianping Li, Xuejie Zhang, Weidong Li:
The Directed Ring Loading with Penalty Cost. WALCOM 2015: 20-31 - 2014
- [j10]Weidong Li, Jianping Li, Li Guan:
Approximation algorithms for the ring loading problem with penalty cost. Inf. Process. Lett. 114(1-2): 56-59 (2014) - [j9]Jianping Li, Weidong Li, Junran Lichen:
The subdivision-constrained routing requests problem. J. Comb. Optim. 27(1): 152-163 (2014) - [j8]Weidong Li, Jianping Li:
Approximation algorithms for $k$ -partitioning problems with partition matroid constraint. Optim. Lett. 8(3): 1093-1099 (2014) - [c4]Weidong Li, Jianping Li, Xuejie Zhang, Zhibin Chen:
Parallel-Machine Scheduling Problem under the Job Rejection Constraint - (Extended Abstract). FAW 2014: 158-169 - 2012
- [j7]Weidong Li, Jianping Li, Tongquan Zhang:
Two Approximation Schemes for Scheduling on Parallel Machines under a grade of Service Provision. Asia Pac. J. Oper. Res. 29(5) (2012) - [j6]Jianping Li, Weidong Li, Lusheng Wang:
A polynomial time approximation scheme for embedding a directed hypergraph on a weighted ring. J. Comb. Optim. 24(3): 319-328 (2012) - 2009
- [j4]Jianping Li, Weidong Li, Jianbo Li:
Polynomial Approximation Schemes for the Max-Min Allocation Problem under a grade of Service Provision. Discret. Math. Algorithms Appl. 1(3): 355-368 (2009) - [j3]Tongquan Zhang, Weidong Li, Jianping Li:
An improved approximation algorithm for the ATSP with parameterized triangle inequality. J. Algorithms 64(2-3): 74-78 (2009) - [j2]Jianping Li, Weidong Li, Tongquan Zhang, Zhongxu Zhang:
The subdivision-constrained minimum spanning tree problem. Theor. Comput. Sci. 410(8-10): 877-885 (2009) - [c2]Jianping Li, Weidong Li, Jianbo Li:
Polynomial Approximation Schemes for the Max-Min Allocation Problem under a Grade of Service Provision. COCOA 2009: 1-13 - 2007
- [j1]Mingxia Chen, Jianbo Li, Jianping Li, Weidong Li, Lusheng Wang:
Some approximation algorithms for the clique partition problem in weighted interval graphs. Theor. Comput. Sci. 381(1-3): 124-133 (2007) - 2006
- [c1]Jianbo Li, Mingxia Chen, Jianping Li, Weidong Li:
Minimum Clique Partition Problem with Constrained Weight for Interval Graphs. COCOON 2006: 459-468
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 2024-04-25 02:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint