default search action
Tao Ye 0005
Person information
- affiliation: Huazhong University of Science and Technology, Wuhan, China
Other persons with the same name
- Tao Ye — disambiguation page
- Tao Ye 0001
— Amazon, San Francisco, CA, USA
- Tao Ye 0002
- Tao Ye 0003
- Tao Ye 0004
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
- [c3]Taoqing Zhou, Zhipeng Lü, Tao Ye, Kan Zhou:
A Memetic Algorithm for the Linear Ordering Problem with Cumulative Costs. COCOA (2) 2017: 518-526 - 2016
- [j9]Zhuo Wang, Zhipeng Lü, Tao Ye:
Multi-neighborhood local search optimization for machine reassignment problem. Comput. Oper. Res. 68: 16-29 (2016) - 2015
- [j8]Xinyun Wu
Two-level iterated local search for WDM network design problem with traffic grooming. Appl. Soft Comput. 37: 715-724 (2015) - [j7]Xinyun Wu
GRASP for traffic grooming and routing with simple path constraints in WDM mesh networks. Comput. Networks 86: 27-39 (2015) - 2014
- [c2]Xinyun Wu, Zhipeng Lü, Qi Guo, Tao Ye:
GRASP for WDM network design problem with traffic grooming. ICNC 2014: 514-519 - [i5]Tao Ye, Tao Wang, Zhipeng Lü, Jin-Kao Hao:
A Multi-parent Memetic Algorithm for the Linear Ordering Problem. CoRR abs/1405.4507 (2014) - [i4]Tao Ye, Kan Zhou, Zhipeng Lü, Jin-Kao Hao:
A Memetic Algorithm for the Linear Ordering Problem with Cumulative Costs. CoRR abs/1405.4510 (2014) - 2013
- [j6]Kun He, Danzeng Mo, Tao Ye, Wenqi Huang:
A coarse-to-fine quasi-physical optimization method for solving the circle packing problem with equilibrium constraints. Comput. Ind. Eng. 66(4): 1049-1060 (2013) - [c1]Wei Xiao, Wenqing Chu, Zhipeng Lü, Tao Ye, Guang Liu, Shanshan Cui:
A Population-Based Strategic Oscillation Algorithm for Linear Ordering Problem with Cumulative Costs. EvoCOP 2013: 49-60 - [i3]Tao Ye, Wenqi Huang, Zhipeng Lü:
Iterated Tabu Search Algorithm for Packing Unequal Circles in a Circle. CoRR abs/1306.0694 (2013) - 2012
- [j5]Wenqi Huang, Tao Ye, Duanbing Chen:
Corner occupying theorem for the two-dimensional integral rectangle packing problem. Sci. China Inf. Sci. 55(11): 2466-2472 (2012) - 2011
- [j4]Wenqi Huang, Tao Ye:
Quasi-physical global optimization method for solving the equal circle packing problem. Sci. China Inf. Sci. 54(7): 1333-1339 (2011) - [j3]Wenqi Huang, Tao Ye:
Global optimization method for finding dense packings of equal circles in a circle. Eur. J. Oper. Res. 210(3): 474-481 (2011) - [j2]Tao Ye, Ruchu Xu, Wenqi Huang:
Global Optimization of Binary Lennard-Jones Clusters Using Three Perturbation Operators. J. Chem. Inf. Model. 51(3): 572-577 (2011) - [i2]Wenqi Huang, Tao Ye, Duanbing Chen:
Bottom-Left Placement Theorem for Rectangle Packing. CoRR abs/1107.4463 (2011) - [i1]Wenqi Huang, Tao Ye, Duanbing Chen:
Corner Occupying Theorem for the Two-dimensional Integral Rectangle Packing Problem. CoRR abs/1111.3715 (2011) - 2010
- [j1]Wenqi Huang, Tao Ye:
Greedy vacancy search algorithm for packing equal circles in a square. Oper. Res. Lett. 38(5): 378-382 (2010)
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-13 01:08 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: