logo

师资队伍

刘咸亮



籍贯:江西吉安; 职称:讲师、硕士生导师;联系方式:liuxianliang1@126.com.

研究方向:算法设计与分析;二型模糊逻辑系统理论与应用;模糊人工智能.

欢迎对科研感兴趣的同学报考研究生,请有报考意向的同学将简历发送至邮箱:liuxianliang1@126.com.


教育经历:

2005.09–2009.07 陕西理工大学,数学与应用数学,学士学位,汉中. 导师:李金龙 教授.

2009.09–2012.07 西安交通大学,计算数学,硕士学位,西安. 导师:王卫 教授.

2012.09–2016.06 西安交通大学,计算数学,博士学位,西安. 导师:徐宗本 院士、王卫 教授.


主持国家课题:
项目编号: 11701236.
项目名称:无线传感网络及社交网络中几类控制集问题的近似算法.
项目来源:国家自然科学基金青年科学基金项目.
起讫时间: 2018.01–2020.12.


Working Papers:

[1] Xianliang Liu. Exact Solutions for the two Disjoint Connected Dominating Sets Problem on Some Special Graphs, submitted.

[2] Xianliang Liu, Zishen Yang, Wei Wang. The t-Latency Bounded Strong Target Set Selection Problem in Some Kinds of Special Family of Graphs, submitted.

[3] Xianliang Liu, Shuping Wan. Binary Algorithms for the Centroid of an Interval Type-2 Fuzzy Set, submitted.

[4] Xianliang Liu, Yonghao Ma. A Method to Analyze the Rank Reversal Problem in the ELECTRE II Method, submitted. 


Peer-reviewed Journal Papers:

[8] Xianliang Liu, Shuping Wan. A method to calculate the ranges of criteria weights in ELECTRE I and II methods, Computers & Industrial Engineering, 2019, 137: 106067.

[7] Xianliang Liu, Zishen Yang, Wei Wang. Some Results for the two Disjoint Connected Dominating Sets Problem. Discrete Mathematics, Algorithms and Applications, 2019. DOI: 10.1142/S1793830919500654.

[6] Xianliang Liu, Shuping Wan. Combinatorial Iterative Algorithms for Computing the Centroid of an Interval Type-2 Fuzzy Set. IEEE Transactions on Fuzzy Systems, 2019. DOI: 10.1109/TFUZZ.2019.2911918.

[5] Xianliang Liu, Zishen Yang, Wei Wang. Algorithm and complexity of the two disjoint connected dominating sets problem on trees. Applied Mathematics and Computation, 2018, 337: 419–427.

[4] Xianliang Liu, Wei Wang, Donghyun Kim, Zishen Yang, Alade O Tokuta, Yaolin Jiang. The First Constant Factor Approximation for Minimum Partial Connected Dominating Set Problem in Growth-bounded Graphs. Wireless Networks, 2016, 22(2): 553-562.

[3] Xianliang Liu, Zishen Yang, Wei Wang. Exact Solutions for Latency-Bounded Target Set Selection Problem on Some Special Families of Graphs. Discrete Applied Mathematics, 2016, 203(20): 111–116.

[2] Dongyue Liang, Zhao Zhang, Xianliang Liu, Wei Wang, Yaolin Jiang. Approximation Algorithms for Minimum Weight Partial Connected Set Cover Problem. Journal of Combinatorial Optimization, 2016, 31(2): 696-712.

[1] Xianliang Liu, Hongliang Lu, Wei Wang, Weili Wu. PTAS for the Minimum k-path Connected Vertex Cover Problem in Unit Disk Graphs. Journal of Global Optimization, 2013, 56(2): 449-458.

Copyright(c) 2018 All Rights Reserved 版权所有:江西财经大学信息管理学院

地址:江西省南昌市昌北经济技术开发区玉屏大道 邮编:330032