default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChang-Chun Lin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j19]Chang-Chun Lin
, Yen-I Chiang:
Alternative formulations for the obnoxious p-median problem. Discret. Appl. Math. 289: 366-373 (2021)
2010 – 2019
- 2016
- [j18]Chang-Chun Lin, Yi-Ting Liu, An-Pin Chen:
Hedging an option portfolio with minimum transaction lots: A fuzzy goal programming problem. Appl. Soft Comput. 47: 295-303 (2016) - [j17]Chang-Chun Lin, Shih-Wei Lin:
Two-stage approach to the intermodal terminal location problem. Comput. Oper. Res. 67: 113-119 (2016) - 2014
- [j16]Chang-Chun Lin, Yen-I Chiang, Shih-Wei Lin:
Efficient model and heuristic for the intermodal terminal location problem. Comput. Oper. Res. 51: 41-51 (2014) - 2010
- [j15]Chang-Chun Lin, Lu-Chuan Tseng:
Website reorganization using an ant colony system. Expert Syst. Appl. 37(12): 7598-7605 (2010)
2000 – 2009
- 2009
- [j14]Chang-Chun Lin:
Comments on "A mixed integer linear programming formulation of the optimal mean/Value-at-Risk portfolio problem". Eur. J. Oper. Res. 194(1): 339-341 (2009) - 2008
- [j13]Chang-Chun Lin, Yi-Ting Liu:
Genetic algorithms for portfolio selection problems with minimum transaction lots. Eur. J. Oper. Res. 185(1): 393-404 (2008) - [j12]Chieh-Yow Chianglin, Chang-Chun Lin:
Personal financial planning based on fuzzy multiple objective programming. Expert Syst. Appl. 35(1-2): 373-378 (2008) - [j11]Sheng-Yuan Tseng, Chang-Chun Lin, Yueh-Min Huang:
Ant colony-based algorithm for constructing broadcasting tree with degree and delay constraints. Expert Syst. Appl. 35(3): 1473-1481 (2008) - 2007
- [j10]Chang-Chun Lin:
A revised framework for deriving preference values from pairwise comparison matrices. Eur. J. Oper. Res. 176(2): 1145-1150 (2007) - 2006
- [j9]Chang-Chun Lin:
A genetic algorithm for solving the two-dimensional assortment problem. Comput. Ind. Eng. 50(1-2): 175-184 (2006) - [j8]Sheng-Yuan Tseng, Yueh-Min Huang, Chang-Chun Lin:
Genetic algorithm for delay- and degree-constrained multimedia broadcasting on overlay networks. Comput. Commun. 29(17): 3625-3632 (2006) - [j7]Chang-Chun Lin:
Competence set expansion using an efficient 0-1 programming model. Eur. J. Oper. Res. 170(3): 950-956 (2006) - [j6]Chang-Chun Lin:
Optimal Web site reorganization considering information overload and search depth. Eur. J. Oper. Res. 173(3): 839-848 (2006) - [j5]Chang-Chun Lin:
An enhanced goal programming method for generating priority vectors. J. Oper. Res. Soc. 57(12): 1491-1496 (2006) - 2004
- [j4]Chang-Chun Lin, An-Pin Chen:
Fuzzy discriminant analysis with outlier detection by genetic algorithm. Comput. Oper. Res. 31(6): 877-888 (2004) - [j3]Chang-Chun Lin:
A weighted max-min model for fuzzy goal programming. Fuzzy Sets Syst. 142(3): 407-420 (2004) - 2002
- [j2]Chang-Chun Lin, An-Pin Chen:
Generalization of Yang et al.'s method for fuzzy programming with piecewise linear membership functions. Fuzzy Sets Syst. 132(3): 347-352 (2002) - 2001
- [j1]An-Pin Chen, Chang-Chun Lin:
Fuzzy approaches for fault diagnosis of transformers. Fuzzy Sets Syst. 118(1): 139-151 (2001)
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-04 03:14 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:
