default search action
Ming-Hua Lin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [j14]Jung-Fa Tsai, Ming-Hua Lin, Duan-Yi Wen:
Global Optimization for Mixed-Discrete Structural Design. Symmetry 12(9): 1529 (2020)
2010 – 2019
- 2018
- [j13]Ming-Hua Lin, Jung-Fa Tsai, Yi-Chung Hu, Tzu-Hsuan Su:
Optimal Allocation of Virtual Machines in Cloud Computing. Symmetry 10(12): 756 (2018) - [j12]Jung-Fa Tsai, Ming-Hua Lin, Pei-Chun Wang:
An Efficient Deterministic Approach to Optimal Design of Reliable Networks. IEEE Trans. Reliab. 67(2): 598-608 (2018) - 2013
- [j11]Jung-Fa Tsai, Ming-Hua Lin:
An improved framework for solving NLIPs with signomial terms in the objective or constraints to global optimality. Comput. Chem. Eng. 53: 44-54 (2013) - 2012
- [j10]Jung-Fa Tsai, Pei-Chun Wang, Ming-Hua Lin:
Optimal expansion of competence sets with multilevel skills. Comput. Ind. Eng. 62(3): 770-776 (2012) - [j9]Ming-Hua Lin, Jung-Fa Tsai:
Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems. Eur. J. Oper. Res. 216(1): 17-25 (2012) - 2011
- [j8]Jung-Fa Tsai, Ming-Hua Lin:
An Efficient Global Approach for Posynomial Geometric Programming Problems. INFORMS J. Comput. 23(3): 483-492 (2011)
2000 – 2009
- 2009
- [j7]Ming-Hua Lin:
An optimal workload-based data allocation approach for multidisk databases. Data Knowl. Eng. 68(5): 499-508 (2009) - [j6]Ming-Hua Lin, Jung-Fa Tsai, Yinyu Ye:
Budget Allocation in a Competitive Communication Spectrum Economy. EURASIP J. Adv. Signal Process. 2009 (2009) - 2008
- [j5]Jung-Fa Tsai, Ming-Hua Lin, Yi-Chung Hu:
Finding multiple solutions to general integer linear programs. Eur. J. Oper. Res. 184(2): 802-809 (2008) - [j4]Jung-Fa Tsai, Ming-Hua Lin:
Global optimization of signomial mixed-integer nonlinear programming problems with free variables. J. Glob. Optim. 42(1): 39-49 (2008) - 2007
- [j3]Jung-Fa Tsai, Ming-Hua Lin, Yi-Chung Hu:
On generalized geometric programming problems with non-positive variables. Eur. J. Oper. Res. 178(1): 10-19 (2007) - 2006
- [j2]Jung-Fa Tsai, Ming-Hua Lin:
An optimization approach for solving signomial discrete programming problems with free variables. Comput. Chem. Eng. 30(8): 1256-1263 (2006) - [j1]Chi-Chun Lo, Ming-Hua Lin:
Location-based incentive pricing for tree-based relaying in multi-hop cellular networks. Comput. Commun. 29(16): 3148-3157 (2006) - [c5]Ming-Hua Lin, Kuen-Liang Sue:
A Quality of Relay-Based Routing Scheme in Multi-hop Cellular Networks. ICOIN 2006: 166-174 - [c4]Kuen-Liang Sue, Chung-Hsien Tsai, Ming-Hua Lin:
FLEXOR: A Flexible Localization Scheme Based on RFID. ICOIN 2006: 306-316 - 2005
- [c3]Ming-Hua Lin, Chi-Chun Lo:
A Quality of Relay-Based Incentive Pricing Scheme for Relaying Services in Multi-hop Cellular Networks. ICOIN 2005: 796-805 - 2004
- [c2]Ming-Hua Lin, Chi-Chun Lo:
A Dynamic Incentive Pricing Scheme for Relaying Services in Multi-hop Cellular Networks. ICOIN 2004: 211-220 - 2003
- [c1]Ming-Hua Lin, Chi-Chun Lo, Wayne Zhuang:
A Flexible Time-based Pricing Policy for Charging Internet Services. CAiSE Short Paper Proceedings 2003
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-04-24 23:00 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint