刘龙城
职称：副教授
职务：
学历：博士
电子邮件：longchengliu@xmu.edu.cn
联系电话：
办 公 室：数理大楼675室




个人主页：个人主页链接（http://math-faculty.xmu.edu.cn/display.aspx?tid=89）

教育经历： 2004.9-2009.6 Zhejiang University, Department of Mathematics, Master & Doctor
2000.9-2004.6 Zhejiang University, Department of Mathematics, Bachelor
工作经历：
2012.8- Xiamen University, School of Mathematical Sciences, Associate Professor
2017.8-2018.8 University of Alberta, Department of Computing Science, Visiting Professor
2009.7-2012.7 Xiamen University, School of Mathematical Sciences, Assistant Professor
研究方向：
· Design and Analysis of Algorithms
· Combinatorial Optimization
· Game Theory
社会兼职：
美国《Mathematical Reviews》 评论员（91304）
中国运筹学会 会员
中国工业与应用数学学会 会员
授课情况：
高等数学A、B、C、E；高等数学选讲；博弈论；运筹学；组合优化 ；运筹与优化；图论
微积分I，II，III，IV，V
获奖：
2011 厦门大学第六届青年教师教学技能比赛 二等奖
2012 厦门大学中国银行奖教金
2012 白昆水优秀论文奖 二等奖
主持项目：
1. Fundamental Research Funds for the Central Universities (Grant No. ), PI.
2. Fundamental Research Funds for the Central Universities (Grant No. ), PI.
3. Fujian Provincial Natural Science Foundation of China (Grant No. 2012J01021), PI.
4. National Natural Science Foundation of China (Grant No. **), PI.
5. Fundamental Research Funds for the Central Universities (Grant No. ), PI.
1.Fundamental Research Funds for the Central Universities (Grant No. ), Co-PI.
2. Fundamental Research Funds for the Central Universities (Grant No. ), Co-PI.
3. Fujian Provincial Natural Science Foundation of China (Grant No. 2010J05013), Co-PI.
4. National Natural Science Foundation of China (Grant No. **), Co-PI.
论文：
Journal
1. Anzhen Peng, Longcheng Liu*, Weifeng Lin, Improved approximation algorithms for two-stage flexible flow shop scheduling, Journal of Combinatorial Optimization, online first.

2. Longcheng Liu*, Han Gao, Chao Li, Inverse maximum flow problem under the combination of the weighted l_2 norm and the weighted Hamming distance. Journal of the Operations Research Society of China, online first.
3. Longcheng Liu, Yong Chen, Jianming Dong, Randy Goebel, Guohui Lin*, Yue Luo, Guanqun Ni, Bing Su, Yao Xu, An Zhang, Approximation algorithms for the three-machine proportionate mixed shop scheduling, Theoretical Computer Science, 803, 57-70. （2020.01）
4. Yong Chen, Guangting Chen, Longcheng Liu, Yiwei Jiang, Zhiyi Tan, An Zhang*, Online scheduling with unit processing times and processing set restrictions, Journal of the Operations Research Society of China, 7, 475-484. （2019.07）
5. Longcheng Liu*, Wenhao Zheng, Chao Li, Inverse minimum flow problem under the weighted sum-type Hamming distance, Discrete Applied Mathematics, 229, 101-112（学院重要期刊）(2017.07)(SCI三区)
6. Longcheng Liu*, Enyu Yao, Capacity inverse minimum cost flow problems under the weighted Hamming distance, Optimization Letters, 10(6), 1257-1268 (2016.08)（SCI 三区）
7. Xiaoyi Hu, Deqing Wang, Yurong Lin, Wei Su, Yongjun Xie, Longcheng Liu, Multi-channel time frequency shift keying in underwater acoustic communication, Applied Acoustics, 103, 54-63 (2016.02)（SCI 四区）
8. Longcheng Liu*, Yong Chen, Biao Wu, Enyu Yao, Some new results on inverse/reverse optimization problems under the weighted Hamming distance, Pacific Journal of Optimization, 11(4), 593-603 (2015.10)（SCI 四区）
9. Yiwei Jiang, Jueliang Hu, Longcheng Liu, Yuqing Zhu, T.C.E. Cheng, Competitive ratios for preemptive and non-preemptive online scheduling with nondecreasing concave machine cost, Information Sciences, 269, 128-141 (2014.06)（SCI 二区）
10. Biao Wu, Longcheng Liu, Enyu Yao, Minizing the maximum bump cost in linear extensions of a poset, Journal of Combinatorial Optimization, 26,509-519(2013.10)（SCI 三区）
11. Longcheng Liu*, Enyu Yao, Weighted inverse maximum perfect matching problems under the Hamming distance, Journal of Global Optimization, 55, 549-557 (2013.03)（SCI 二区）
12. Longcheng Liu*, Biao Wu, Enyu Yao: Minimizing the sum cost in linear extensions of a poset, Journal of Combinatorial Optimization 21, 247-253 (2011.02).（SCI 三区）
13. Yiwei Jiang, Longcheng Liu*,Biao Wu, Enyu Yao: Inverse minimum cost flow problems under the weighted Hamming distance, European Journal of Operational Research, 207: 50-54 (2010.11).（SCI 二区）
14. Biao. Wu, Enyu Yao, Longcheng Liu: A polynomially solvable case of optimal linear extension problem of a poset. Journal of Combinatorial Optimization 20, 422-428 (2010.10)（SCI 三区）
15. Longcheng Liu*, Qin Wang: Constrained Inverse Min-Max Spanning Tree Problems under the Weighted Hamming Distance, Journal of Global Optimization, 43:83–95, (2009. 01).（SCI 二区）
16. Longcheng Liu*, Enyu Yao: Inverse Min-Max Spanning Tree Problem Under the Weighted Sum-Type Hamming Distance, Theoretical Computer Science, 396, 28–34, (2008.05).)（SCI 四区）
17. Longcheng Liu*,Enyu Yao: A weighted inverse minimum cut problem under the bottleneck type Hamming distance, Asia-Pacific Journal of Operational Research,24(5), 725–736, (2007.10).)（SCI 四区）
18. Longcheng Liu*,Jianzhong Zhang: Inverse maximum flow problem under the weighted Hamming distance, Journal of Combinatorial Optimization, 12, 395-408, (2006.12).（SCI 三区）
19. Longcheng Liu*,Yong. He.: Inverse minimum spanning tree problem and reverse shortest path problem with discrete values, Progress in Natural Science, 16(6), 649-655, (2006.06).)（SCI 四区）
Conference
1. Yong Chen, Randy Goebel, Guohui Lin*, Longcheng Liu, Bing Su, Weitian Tong, Yao Xu, An Zhang, A local search 4/3-approximation algorithm for the minimum 3-paht partition problem. In proceedings of 13th International Frontiers of Algorithmics Workshop (FAW 2019). Lecture Notes in Computer Science 11458, 14-25. (2019.04)
2. Longcheng Liu, Guanqun Ni, Yong Chen, Randy Goebel, Yue Luo, An Zhang, Guohui Lin*, Approximation algorithms and a hardness result for the three-machine proportionate mixed shop. In proceedings of the 12th International Conference on Algorithmic Aspects in Information and Management (AAIM 2018). Lecture Notes in Computer Science 11343,268-280.(2018.12)(EI)
3. Yinhui Cai#, Guangting Chen, Yong Chen*, Randy Goebel, Guohui Lin*, Longcheng Liu#, An Zhang, Approximation algorithms for two-machine flow-shop scheduling with a conflict graph. In proceedings of 24th International Computing and Combinatorics (COCOON 2018). Lecture Notes in Computer Science 10976, 205-217. (2018.07)(EI)
4. Longcheng Liu*, Yu’an Chen, Wenhao Zheng, Deqing Wang, Inverse multicast quality of service routing problem with bandwidth and delay under the weighted l_1 norm, Proceedings of 11th EAI International Conference on Testbeds and Research Infrastructures for the Development of Networks & Communities, Volume 177 of the series Lecture Notes of the Institute for Computer Sciences, Social Informatics and Tele communications Engineering 158-167 (2016.11)(EI)
5. Longcheng Liu*,Inverse Maximum Flow Problems under the Combining Norms. In proceedings of the 2013 Joint Conference of Frontiers of Algorithm Workshop and Algorithmic Aspects of Information and Management (FAW-AAIM 2013), Lecture Notes in Computer Science, 7924, 221-230 (2013.06)(EI)
6. Longcheng Liu*, Yong Chen, Biao Wu, Enyu Yao, Weighted inverse minimum cut problem under the sum-type Hamming distance, Lecture Notes in Computer Science, 7285, 26-35 (2012.05)(EI)


学生培养：
硕士研究生
在读：
2020 黄旻，杨启夏 2019 代宇波，段懿红 2018 林伟丰，彭安镇
已毕业：
2017 孙晓惠，王廷鑫，郑啟豪 2016 常华飞，肖秋龙 2013 陈俞安，姜秀秀，李超
拔尖计划学生
崔佳(2013), 高寒(2014), 罗月(2015), 王子豪(2018), 王天润(2019)