Current position:Associate Professor
Contact Information:
School of Mathematical Science,
Ocean University of China,
238 Songling Road,
Qingdao, China, 266100
Email:qqnong@ouc.edu.cn
Education:
Sep. 2003-Jan. 2007P
h.D. in Mathematics, Department of Mathematics, Zhengzhou University
Sep. 2000-Jul. 2003
M.Sc. in Computational Mathematics, Department of Mathematics, Yunnan University
Sep. 1996-Jul. 2000
B.Sc. in Mathematics, Department of Mathematics and Information Science, Guangxi University
Professional Experience:
Aug. 2006- Present: Lecturer, Associate Professor, School of Mathematical Science, Ocean University of China.
Aug. 2018-Sep. 2018: Research Scholar, Department of Logistics and Maritime Studies, Hong Kong Polytechnic University.
Jan. 2016- Mar. 2016: Research Scholar, Department of Logistics and Maritime Studies, Hong Kong Polytechnic University.
Jan. 2010- Dec. 2010: Research Assistant, Department of Logistics and Maritime Studies, Hong Kong Polytechnic University.
Jul. 2007- Sep. 2007: Research Assistant, Department of Logistics, Hong Kong Polytechnic University.
Jun. 2006- Aug. 2006: Research Assistant, Department of Logistics, Hong Kong Polytechnic University.
Research Interests:
Approximation algorithm design and hardness proof of combinatorial optimization problems; Designing coordination mechanisms for non-cooperative games; Computational complexity analysis on solutions for cooperative games.
Grants:
[1] Design and Analysis on Coordination Mechanisms for Bin Packing Games,tional Natural Science Foundation of Shandong Province (ZR20180708025), 2019-2022.
[2] Algorithmic Research onOptimization Problems and Cooperative Games with Non-submodular Functions in Social Networks National Natural Science Foundation of China(11871442), Co-investigator (PI: Qingzhi Fang), 2019-2022.
[3] Summer School for Non-Submodular Optimization, Tianyuan Fund of National Natural Science Foundation of China (11826030), Co-investigator (PI: Qingzhi Fang), 2018-2019.
[4] Research on Coordination Mechanisms for Some Scheduling Game Problems.National Natural Science Foundation of China(11201439), 2013-2015.
[5] Designing and Analyzing Coordination Mechanisms for Non-cooperative Scheduling Game Problems.Doctoral Fund of Ministry of Education of China (20120132120001), 2013-2015.
[6] Research on Coordination Mechanisms for Scheduling Games,Natural Science Foundation ofShandong Province (ZR2012AQ012), 2012-2015.
[7] Algorithmic Research on Combinatorial Cooperative Games with Coalition Structure. National Natural Science Foundation of China(11271341), Co-investigator (PI: Qingzhi Fang), 2013-2015.
[8] Algorithmic Research on Combinatorial Cooperative Games. National Natural Science Foundation of China(10771200), Co-investigator (PI: Qingzhi Fang), 2008-2010.
SelectedPublications:
1. Qingqin Nong∗, Jiapeng Wang, Suning Gong and Saijun Guo，A bin packing game with cardinality constraintsunder the best cost rule，Discrete Mathematics, Algorithms and Applications, 11(2): 1950022, 2019.
2.Q. Q. Nong*, T. Sun, T. C. E. Cheng, Q. Z. Fang. Bin packing game with a price of anarchy of 3/2. Journal of Combinatorial Optimization, 2: 1-9, 2018.
3. G. Q. Fanand Q. Q. Nong*. A coordination mechanism for a scheduling game with uniform-batching machines,Asia-Pacific Journal of Operational Research, 35(5) (2018) 1850033 (15 pages).
4. Qizhi Fang, Xin Chen,Qingqin Nong, Zongchao Zhang, Yongchang Cao, Yan Feng, Tao Sun, Suning Gong, Ding-Zhu Du. General Rumor Blocking: An Efficient Random Algorithm with Martingale Approach. AAIM 2018: 161-176
5.Q. Q. Nong* and G. Q. Fan. A coordination mechanism for a scheduling game with parallel-batching machines.Journal of Combinatorial Optimization, 2017, 33(2): 567-579.
6. Xin Chen,Qingqin Nong*, Yan Feng, Yongchang Cao, Suning Gong, Qizhi Fang and Ker-I Ko. Centralized and decentralized rumor blocking problems.Journal of Combinatorial Optimization, 2017, 34:314-329.
7.Qing-Qin Nong*, Sai-Jun Guo and Li-Hui Miao. The Shortest First Coordination Mechanism for a Scheduling Game with Parallel-Batching Machines.Journal of the Operations Research Society of China. 2016, 4: 517–527.
8. X. Chen,Qingqin Nong, Qizhi Fang*. An Improved Mechanism for Selfish Bin Packing. International Conference on Combinatorial Optimization and Applications. Springer, Cham, 2017: 241-257. (COCOA 2017)
9.Q.Q. Nong, T.C.E. Cheng* and C.T. Ng. Two-agent scheduling to minimize the total cost.European Journal of Operational Research. 2011, 215:39-44.
10. T.C.E. Cheng*,Q.Q. Nong and C.T. Ng, Polynomial-Time Approximation Scheme for Concurrent Open Shop Scheduling with a Fixed Number of Machines to Minimize the Total Weighted Completion Time.Naval Research Logistics, 2011, 58, 763-770.
11.Q.Q. Nong, T.C.E. Cheng* and C.T. Ng. A polynomial-time algorithm for the weighted link ring loading problem with integer demand splitting.Theoretical Computer Science, 2010, 411: 2978-2986.
12.Qingqin Nong，Jinjiang Yuan*, Ruyan Fu, Lin Lin and Ji Tian. The single machine parallel batch on-line scheduling problem with family jobs to minimize makespan.InternationalJournal ofProduction Economics, 2008, 111: 435-440.
13. Q.Q. Nong, C.T. Ng* and T.C.E. Cheng, 2008. The bounded single-machine paralll-batching scheduling problem with family jobs and release dates to minimize makespan, OperationsResearch Letters, 36(1): 61-66.
14.Q.Q. Nong, T.C.E. Cheng* and C.T. Ng, 2008. An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines,Operations Research Letters, 36(5): 584-588.