default search action
I-Lin Wang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j10]I-Lin Wang, Tsung-Han Wang:
Efficient routing in robotic movable fulfillment systems with integer programming: A rolling horizon and heuristic approach. Robotics Comput. Integr. Manuf. 91: 102849 (2025) - 2022
- [j9]I-Lin Wang
, Yu-Ge Li
The Effect of Repetitive Drop Jumps among Different Heights on Bilateral Asymmetry of Countermovement Jumps. Symmetry 14(2): 190 (2022) - 2021
- [j8]Ke-Ke Zhang, Yi-Ming Chen
Different Drop Heights in Bilateral Asymmetry and Interjoint Coordination during Repetitive Drop-Jumps. Symmetry 13(9): 1590 (2021) - [j7]An-Hsu Chen, Chih-Hui Chiu, Chin-Hsien Hsu
Acute Effects of Vibration Foam Rolling Warm-Up on Jump and Flexibility Asymmetry, Agility and Frequency Speed of Kick Test Performance in Taekwondo Athletes. Symmetry 13(9): 1664 (2021)
2010 – 2019
- 2013
- [j6]Jia Shu, Mabel C. Chou
Models for Effective Deployment and Redistribution of Bicycles Within Public Bicycle-Sharing Systems. Oper. Res. 61(6): 1346-1359 (2013) - [c2]I-Lin Wang
Analyzing Bike Repositioning Strategies Based on Simulations for Public Bike Sharing Systems: Simulating Bike Repositioning Strategies for Bike Sharing Systems. IIAI-AAI 2013: 306-311 - 2012
- [j5]I-Lin Wang
Scheduling two-stage hybrid flow shops with parallel batch, release time, and machine eligibility constraints. J. Intell. Manuf. 23(6): 2271-2280 (2012) - 2011
- [j4]I-Lin Wang
Haplotyping populations by pure parsimony based on compatible genotypes and greedy heuristics. Appl. Math. Comput. 217(23): 9798-9809 (2011) - [j3]I-Lin Wang
A network flow model for clustering segments and minimizing total maintenance and rehabilitation cost. Comput. Ind. Eng. 60(4): 593-601 (2011)
2000 – 2009
- 2008
- [j2]I-Lin Wang
On Solving Shortest Paths with a Least-Squares primal-Dual Algorithm. Asia Pac. J. Oper. Res. 25(2): 135-150 (2008) - 2006
- [c1]I-Lin Wang
Computational Experiments on Algorithms for Haplotype Inference Problems by Pure Parsimony. JCIS 2006 - 2005
- [j1]I-Lin Wang
A Multiple Pairs Shortest Path Algorithm. Transp. Sci. 39(4): 465-476 (2005)
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-09-18 00:16 CEST 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: