default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWei Yu 0011
Person information
- affiliation: East China University of Science and Technology, Shanghai, China
Other persons with the same name
- Wei Yu — disambiguation page
- Wei Yu 0001
![[0000-0002-7453-422X]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-7453-422X")
— University of Toronto, Department of Electrical and Computer Engineering, ON, Canada (and 1 more) - Wei Yu 0002 — Towson University, Department of Computer & Information Sciences (and 1 more)
- Wei Yu 0003 — Microsoft Corporation, Redmond, USA (and 1 more)
- Wei Yu 0004 — Harbin Institute of Technology, School of Computer Science and Technology, China
- Wei Yu 0005 — Citadel Investment Group, Chicago, USA (and 1 more)
- Wei Yu 0006 — Centers for Disease Control and Prevention, Atlanta, USA
- Wei Yu 0007 — Tsinghua University, National Laboratory for Information Science and Technology (and 2 more)
- Wei Yu 0008 — Chinese Academy of Sciences, Institute of Information Engineering, Beijing, China (and 1 more)
- Wei Yu 0009 — Wuhan University, Computer School, China
- Wei Yu 0010 — Zhijiang University, Hangzhou, China
- Wei Yu 0012 — Xiamen University, China
- Wei Yu 0013 — Earth Resources Technology, Inc., Laurel, MD, USA
- Wei Yu 0014 — Graz University of Technology, Austria
- Wei Yu 0015 — Nanjing Forestry University, College of Automobile and Transport Engineering, China
- Wei Yu 0016 — Tianjin University, School of Computer Science and Technology, China
- Wei Yu 0017 — Nantong University, School of Electronics and Information / Engineering Training Center, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j17]Shiming Li, Wei Yu, Zhaohui Liu:
A local search algorithm for the k-path partition problem. Optim. Lett. 18(1): 279-290 (2024)- 2023
- [j16]Yuhui Sun, Wei Yu, Zhaohui Liu:
Approximation algorithms for some min-max and minimum stacker crane cover problems. J. Comb. Optim. 45(1): 18 (2023) - [j15]Wei Yu:
Improved approximation algorithms for some min-max postmen cover problems with applications to the min-max subtree cover. Math. Methods Oper. Res. 97(1): 135-157 (2023) - 2022
- [j14]Yuying Mao, Wei Yu, Zhaohui Liu, Jiafeng Xiong:
Approximation algorithms for some Minimum Postmen Cover Problems. Discret. Appl. Math. 319: 382-393 (2022) - [j13]Wei Yu, Zhaohui Liu:
Approximation and polynomial algorithms for the data mule scheduling with handling time and time span constraints. Inf. Process. Lett. 178: 106299 (2022) - [j12]Wei Yu, Zhaohui Liu, Xiaoguang Bao:
Distance constrained vehicle routing problem to minimize the total cost: algorithms and complexity. J. Comb. Optim. 43(5): 1405-1422 (2022) - [j11]Yichen Yang, Zhaohui Liu, Wei Yu:
Approximation algorithms for the k-depots Hamiltonian path problem. Optim. Lett. 16(4): 1215-1234 (2022) - 2021
- [j10]Wei Yu, Zhaohui Liu, Xiaoguang Bao:
Approximation algorithms for some min-max postmen cover problems. Ann. Oper. Res. 300(1): 267-287 (2021) - [c7]Yuhui Sun, Wei Yu, Zhaohui Liu:
Approximation Algorithms for Some Min-Max and Minimum Stacker Crane Cover Problems. COCOA 2021: 400-415 - 2020
- [j9]Wei Yu, Zhaohui Liu, Xiaoguang Bao:
New LP relaxations for Minimum Cycle/Path/Tree Cover Problems. Theor. Comput. Sci. 803: 71-81 (2020)
2010 – 2019
- 2019
- [j8]Wei Yu, Zhaohui Liu:
Better approximability results for min-max tree/cycle/path cover problems. J. Comb. Optim. 37(2): 563-578 (2019) - [j7]Wei Yu, Zhaohui Liu, Xiaoguang Bao:
New approximation algorithms for the minimum cycle cover problem. Theor. Comput. Sci. 793: 44-58 (2019) - [c6]Yuying Mao, Wei Yu, Zhaohui Liu, Jiafeng Xiong:
Approximation Algorithms for Some Minimum Postmen Cover Problems. COCOA 2019: 375-386 - [c5]Wei Yu, Zhaohui Liu, Xiaoguang Bao:
Distance Constrained Vehicle Routing Problem to Minimize the Total Cost. COCOON 2019: 639-650 - 2018
- [c4]Wei Yu, Zhaohui Liu, Xiaoguang Bao:
New LP Relaxations for Minimum Cycle/Path/Tree Cover Problems. AAIM 2018: 221-232 - [c3]Wei Yu, Zhaohui Liu, Xiaoguang Bao:
New Approximation Algorithms for the Minimum Cycle Cover Problem. FAW 2018: 81-95 - 2017
- [j6]Xiaoguang Bao, Zhaohui Liu, Wei Yu, Ganggang Li:
A note on approximation algorithms of the clustered traveling salesman problem. Inf. Process. Lett. 127: 54-57 (2017) - [c2]Wei Yu, Zhaohui Liu:
Better Inapproximability Bounds and Approximation Algorithms for Min-Max Tree/Cycle/Path Cover Problems. COCOON 2017: 542-554 - 2016
- [j5]Wei Yu, Zhaohui Liu:
Improved approximation algorithms for some min-max and minimum cycle cover problems. Theor. Comput. Sci. 654: 45-58 (2016) - 2015
- [c1]Wei Yu, Zhaohui Liu:
Improved Approximation Algorithms for Min-Max and Minimum Vehicle Routing Problems. COCOON 2015: 147-158 - 2014
- [j4]Wei Yu, Zhaohui Liu, Xiaoguang Bao:
Optimal deterministic algorithms for some variants of Online Quota Traveling Salesman Problem. Eur. J. Oper. Res. 238(3): 735-740 (2014) - 2011
- [j3]Wei Yu, Zhaohui Liu, Leiyang Wang, Tijun Fan:
Routing open shop and flow shop scheduling problems. Eur. J. Oper. Res. 213(1): 24-36 (2011) - [j2]Wei Yu, Zhaohui Liu:
Single-vehicle scheduling problems with release and service times on a line. Networks 57(2): 128-134 (2011)
2000 – 2009
- 2009
- [j1]Wei Yu, Zhaohui Liu:
Vehicle routing problems on a line-shaped network with release time constraints. Oper. Res. Lett. 37(2): 85-88 (2009)
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 2024-10-31 21:12 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:
