default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYao-Huei Huang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j17]Fang Yang, F. J. Hwang
, Yao-Huei Huang:
A two-stage method for the shipper lane selection problem with time windows in transportation service procurement. Int. Trans. Oper. Res. 31(4): 2209-2230 (2024)- 2022
- [j16]Yao-Huei Huang, Cheng-Hung Hsieh:
A decision support system for available parking slots on the roadsides in urban areas. Expert Syst. Appl. 205: 117668 (2022) - 2021
- [j15]F. J. Hwang, Yao-Huei Huang:
An effective logarithmic formulation for piecewise linearization requiring no inequality constraint. Comput. Optim. Appl. 79(3): 601-631 (2021) - [j14]Fang Yang, Yao-Huei Huang:
An optimization approach for winner determination problem considering transportation cost discounts. J. Glob. Optim. 80(3): 711-728 (2021) - [j13]Han-Lin Li, Yao-Huei Huang, Shu-Cherng Fang, Way Kuo:
A Prime-Logarithmic Method for Optimal Reliability Design. IEEE Trans. Reliab. 70(1): 146-162 (2021) - 2020
- [j12]Hao-Chun Lu, F. J. Hwang, Yao-Huei Huang:
Parallel and distributed architecture of genetic algorithm on Apache Hadoop and Spark. Appl. Soft Comput. 95: 106497 (2020) - [j11]Xingmei Li, Yao-Huei Huang, Shu-Cherng Fang, Youzhong Zhang:
An alternative efficient representation for the project portfolio selection problem. Eur. J. Oper. Res. 281(1): 100-113 (2020)
2010 – 2019
- 2017
- [j10]Han-Lin Li, Yao-Huei Huang, Shu-Cherng Fang:
Linear Reformulation of Polynomial Discrete Programming for Fast Computation. INFORMS J. Comput. 29(1): 108-122 (2017) - 2016
- [j9]Yao-Huei Huang, F. J. Hwang, Hao-Chun Lu:
An effective placement method for the single container loading problem. Comput. Ind. Eng. 97: 212-221 (2016) - [j8]Han-Lin Li, Shu-Cherng Fang, Yao-Huei Huang, Tiantian Nie:
An enhanced logarithmic method for signomial programming with discrete variables. Eur. J. Oper. Res. 255(3): 922-934 (2016) - 2015
- [j7]Hao-Chun Lu, Yao-Huei Huang:
An efficient genetic algorithm with a corner space algorithm for a cutting stock problem in the TFT-LCD industry. Eur. J. Oper. Res. 246(1): 51-65 (2015) - 2014
- [j6]Hao-Chun Lu, Yu-Chien Ko, Yao-Huei Huang:
A note on "Reducing the number of binary variables in cutting stock problems". Optim. Lett. 8(2): 569-579 (2014) - 2013
- [j5]Hao-Chun Lu, Yao-Huei Huang, Kuo-An Tseng:
An integrated algorithm for cutting stock problems in the thin-film transistor liquid crystal display industry. Comput. Ind. Eng. 64(4): 1084-1092 (2013) - [j4]Yao-Huei Huang:
A note on hyper ellipse method for classifying biological and medical data. Comput. Biol. Medicine 43(11): 1978-1986 (2013) - [j3]Han-Lin Li, Yao-Huei Huang, Shu-Cherng Fang:
A Logarithmic Method for Reducing Binary Variables and Inequality Constraints in Solving Task Assignment Problems. INFORMS J. Comput. 25(4): 643-653 (2013) - 2011
- [j2]Han-Lin Li, Yao-Huei Huang:
A DIAMOND method of inducing classification rules for biological data. Comput. Biol. Medicine 41(8): 587-599 (2011) - 2010
- [c1]Han-Lin Li, Yao-Huei Huang, Ming-Hsien Chen:
A DIAMOND Method for Classifying Biological Data. ICMB 2010: 104-114
2000 – 2009
- 2009
- [j1]Jung-Fa Tsai, Ping-Lun Hsieh, Yao-Huei Huang:
An optimization algorithm for cutting stock problems in the TFT-LCD industry. Comput. Ind. Eng. 57(3): 913-919 (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 2025-01-21 00:23 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:
