default search action
Linzhong Liu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j23]Juhua Yang
, Linzhong Liu, Guangwu Chen:
QoS based deliver model of the packages transportation by the passenger train and solution algorithm. Evol. Intell. 17(1): 107-122 (2024) - [j22]Yu Li
Quality control strategies of the supply chain based on stochastic differential game. Evol. Intell. 17(1): 177-188 (2024) - [j21]Wenxia Li, Linzhong Liu, Yu Li, Zhuo Li:
Decision-making and coordination of green supply chain with corporate social responsibility under loss aversion. Evol. Intell. 17(1): 399-415 (2024) - [j20]Shijuan Wang
Product pricing and green decision-making considering consumers' multiple preferences under chain-to-chain competition. Kybernetes 53(1): 152-187 (2024) - 2023
- [j19]Fan Chen
Route Optimization of Customized Buses Based on Optimistic and Pessimistic Values. IEEE Access 11: 11016-11023 (2023) - [j18]Shijuan Wang, Guangwei Wang, Shuqin Zhao, Wenxia Li, Linzhong Liu:
Pricing and green decision-making in a three-echelon supply chain considering fairness concern with the participation of green logistics. Evol. Intell. 16(4): 1285-1307 (2023) - 2020
- [j17]Haiyan Luo, Linzhong Liu, Xun Yang:
Bi-level programming problem in the supply chain and its solution algorithm. Soft Comput. 24(4): 2703-2714 (2020)
2010 – 2019
- 2018
- [j16]Haibo Mu
Route-Based Signal Preemption Control of Emergency Vehicle. J. Control. Sci. Eng. 2018: 1024382:1-1024382:11 (2018) - 2017
- [j15]Linzhong Liu, Haibo Mu, Juhua Yang:
Toward algorithms for multi-modal shortest path problem and their extension in urban transit network. J. Intell. Manuf. 28(3): 767-781 (2017) - [j14]Linzhong Liu, Haibo Mu, Juhua Yang:
Simulated annealing based GRASP for Pareto-optimal dissimilar paths problem. Soft Comput. 21(18): 5457-5473 (2017) - 2015
- [j13]Linzhong Liu, Haibo Mu, Juhua Yang:
Generic constraints handling techniques in constrained multi-criteria optimization and its application. Eur. J. Oper. Res. 244(2): 576-591 (2015) - 2014
- [j12]Linzhong Liu, Haibo Mu, Juhua Yang, Xiaojing Li, Fang Wu:
A simulated annealing for multi-criteria optimization problem: DBMOSA. Swarm Evol. Comput. 14: 48-65 (2014) - 2012
- [j11]Linzhong Liu, Haibo Mu, Yubo Song, Haiyan Luo, Xiaojing Li, Fang Wu:
The equilibrium generalized assignment problem and genetic algorithm. Appl. Math. Comput. 218(11): 6526-6535 (2012) - [j10]Linzhong Liu, Haibo Mu, Xinfeng Yang, Ruichun He
An oriented spanning tree based genetic algorithm for multi-criteria shortest path problems. Appl. Soft Comput. 12(1): 506-515 (2012) - [j9]Linzhong Liu, Haibo Mu, Haiyan Luo, Xiaojing Li:
A simulated annealing for multi-criteria network path problems. Comput. Oper. Res. 39(12): 3119-3135 (2012)
2000 – 2009
- 2008
- [j8]Zhongfu Zhang, Bing Yao, Jingwen Li, Linzhong Liu, Jianfang Wang, Baogen Xu:
On Incidence Graphs. Ars Comb. 87 (2008) - [c7]Linzhong Liu, Xinfeng Yang, Haibo Mu, Yonglan Jiao:
The Fuzzy Fixed Charge Transportation Problem and Genetic Algorithm. FSKD (5) 2008: 208-212 - 2007
- [j7]Lixing Yang
Fuzzy fixed charge solid transportation problem and algorithm. Appl. Soft Comput. 7(3): 879-889 (2007) - [c6]Linzhong Liu, Liang Lin:
Fuzzy Fixed Charge Solid Transportation Problem and Its Algorithm. FSKD (3) 2007: 585-589 - [c5]Linzhong Liu, Yongsheng Qian, Tao Yang:
The Equilibrium Network Model and Its Genetic Algorithm. ICIC (3) 2007: 275-284 - [c4]Tao Yang, Daoli Zhu, Linzhong Liu:
Decomposition Method and Its Automatic Design Algorithm of Station Bottleneck. ICIC (3) 2007: 981-990 - 2006
- [j6]Linzhong Liu, Yinzhen Li:
The fuzzy quadratic assignment problem with penalty: New models and genetic algorithm. Appl. Math. Comput. 174(2): 1229-1244 (2006) - [j5]Linzhong Liu, Yinzhen Li, Lixing Yang
The maximum fuzzy weighted matching models and hybrid genetic algorithm. Appl. Math. Comput. 181(1): 662-674 (2006) - [c3]Linzhong Liu, Ruichun He, Yinzhen Li:
The Fuzzy Weighted k-Cardinality Tree and Its Hybrid Genetic Algorithm. FSKD 2006: 1025-1034 - 2005
- [c2]Yinzhen Li, Ruichun He, Linzhong Liu, Yaohuang Guo:
Genetic Algorithms for Dissimilar Shortest Paths Based on Optimal Fuzzy Dissimilar Measure and Applications. FSKD (1) 2005: 312-320 - 2004
- [c1]Jinwu Gao, Mei Lu, Linzhong Liu:
Chance-constrained programming for fuzzy quadratic minimum spanning tree problem. FUZZ-IEEE 2004: 983-987 - 2003
- [j4]Zhongfu Zhang, Linzhong Liu, Jinwen Li, Enmin Song:
Some properties of Ramsey numbers. Appl. Math. Lett. 16(8): 1187-1193 (2003) - 2002
- [j3]Zhongfu Zhang, Linzhong Liu, Jianfang Wang:
Adjacent strong edge coloring of graphs. Appl. Math. Lett. 15(5): 623-626 (2002)
1990 – 1999
- 1999
- [j2]Zhongfu Zhang, Baogen Xu, Yinzhen Li, Linzhong Liu:
A note on the lower bounds of signed domination number of a graph. Discret. Math. 195(1-3): 295-298 (1999) - 1998
- [j1]Zhongfu Zhang, Linzhong Liu, Jianxun Zhang, Jianfang Wang:
On the Relations Between Arboricity and Independent Number Or Covering Number. Discret. Appl. Math. 87(1-3): 279-283 (1998)
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-07-08 22:27 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: