永利总站ylzz55|首頁|欢迎您

农庆琴
发布者: 崔琪
发布时间:2017-04-12
浏览次数:3066

姓名:农庆琴

职称:副教授、硕士生导师

邮箱:qqnong@ouc.edu.cn

办公室:数学楼621

研究方向:

优化问题的计算复杂性分析与(近似)算法设计

非合作博弈问题的协调机制设计与分析

合作博弈问题的计算复杂性分析和算法设计

主讲课程

高等数学、博弈论、组合最优化

学习与工作经历

1. 2016/01-032018/08-09:香港理工大学,工商管理学院,访问学者

2. 2006/06-08,2007/07-092010/01-12香港理工大学,工商管理学院,助理研究员

科研项目

1. 山东省自然科学基金面上项目,ZR20180708025,装箱博弈问题的机制设计与分析,2019/07-2022/06,主持。

2. 国家自然科学基金面上项目,11871442,社会网络环境下非次模函数优化问题与合作博弈算法研究,2019/01-2022/12,参加(位次2)

3. 国家自然科学基金天元基金,11826030,非次模组合优化暑期学校,2018/07-2019/05,参加(位次3)

4. 国家自然科学基金青年基金项目,11201439,若干排序博弈问题的协调机制,2013/01-2015/12,主持。

5. 国家自然科学基金面上项目,11271341,基于联盟结构组合合作对策的算法研究,2013/01-2016/12,参加(位次3)

6. 教育部博士点专项基金新教师基金,20120132120001,非合作博弈排序问题的协调机制设计与分析,2013/01-2015/12,主持。

7. 山东省自然科学基金青年基金,ZR2012AQ12,排序问题的协调机制研究,2012/06-2016/06,主持。

8. 山东省优秀中青年科学家科研奖励基金,BS2013DX002,可嵌入到曲面上的图的染色问题及其在复杂网络中的应用,2013/10-2015/10,参加(位次3)

9. 国家自然科学基金项目,10771200,组合合作对策算法研究,2008/01-2010/12,参加(位次3)

发表文章及论著

1. Suning Gong, Qingqin Nong*, Tao Sun, Qizhi Fang, Dingzhu Du, Xiaoyu Shao. Maximize a Monotone Function with a Generic Submodularity Ratio, Theoretical Computer Science, 2021, 853: 16-24 (SCI四区)

2. 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, Theoretical Computer Science, 2020, 803: 82-93. (SCI四区)

3. Qingqin Nong, Jiazhu Fang, Suning Gong*, Dingzhu Du, Yan Feng, Xiaoying Qu. A 1/2-Approximation Algorithm for Maximizing a Non-monotone Weak-submodular Function on a Bounded Integer Lattice, Journal of Combinatorial Optimization, 2020, 39: 1208-1220. (SCI三区)

4. Qingqin Nong*, Jiazhu Fang, Suning Gong, Yan Feng, Xiaoying Qu. A Fast Algorithm for Maximizing a Non-monotone DR-submodular Integer Lattice Function, Theoretical Computer Science, 2020, 840: 177-186. (SCI四区)

5. Qingqin Nong, Suning Gong*, Qizhi Fang, Dingzhu Du. A Survey on Double GreedyAlgorithms for Maximizing Non-monotone Submodular Functions, Lecture Notes in Computer Science, Complexity and Approximation, 2020, 12000: 172-186.

6. Suning GongQingqin Nong*Wenjing LiuQizhi Fang. Parametricmonotone functionmaximization withmatroid constraints. Journal of Global Optimization. 75:833–849, 2019. (SCI二区)

7. Qingqin Nong, Jiapeng Wang, Suning Gong and Saijun GuoA bin packing game with cardinality constraintsunder the best cost ruleDiscrete Mathematics, Algorithms and Applications, 11(2):1950022, 2019.

8. 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. (SCI三区)

9. 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). (SCI四区)

10. 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. (SCI三区)

11. 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. (SCI三区)

12. 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.

13. 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)

14. 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. (SCI二区)

15. 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. (SCI四区)

16. 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.  (SCI四区)

17. Qingqin NongJinjiang Yuan*, Ruyan Fu, Lin Lin and Ji Tian. The single machine parallel batch on-line scheduling problem with family jobs to minimize makespan.International Journal of Production Economics, 2008, 111: 435-440. (SCI二区)

18. Q.Q. NongC.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, Operations Research Letters, 36(1): 61-66. (SCI四区)

19. Q.Q. NongT.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.  SCI四区)

  

  

  

  


数学学院

姓            名:

农庆琴

职            称:

邮            箱:

办     公     室:

办 公 室 电 话:

研  究  方  向:

姓名:农庆琴

职称:副教授、硕士生导师

邮箱:qqnong@ouc.edu.cn

办公室:数学楼621

研究方向:

优化问题的计算复杂性分析与(近似)算法设计

非合作博弈问题的协调机制设计与分析

合作博弈问题的计算复杂性分析和算法设计

主讲课程

高等数学、博弈论、组合最优化

学习与工作经历

1. 2016/01-032018/08-09:香港理工大学,工商管理学院,访问学者

2. 2006/06-08,2007/07-092010/01-12香港理工大学,工商管理学院,助理研究员

科研项目

1. 山东省自然科学基金面上项目,ZR20180708025,装箱博弈问题的机制设计与分析,2019/07-2022/06,主持。

2. 国家自然科学基金面上项目,11871442,社会网络环境下非次模函数优化问题与合作博弈算法研究,2019/01-2022/12,参加(位次2)

3. 国家自然科学基金天元基金,11826030,非次模组合优化暑期学校,2018/07-2019/05,参加(位次3)

4. 国家自然科学基金青年基金项目,11201439,若干排序博弈问题的协调机制,2013/01-2015/12,主持。

5. 国家自然科学基金面上项目,11271341,基于联盟结构组合合作对策的算法研究,2013/01-2016/12,参加(位次3)

6. 教育部博士点专项基金新教师基金,20120132120001,非合作博弈排序问题的协调机制设计与分析,2013/01-2015/12,主持。

7. 山东省自然科学基金青年基金,ZR2012AQ12,排序问题的协调机制研究,2012/06-2016/06,主持。

8. 山东省优秀中青年科学家科研奖励基金,BS2013DX002,可嵌入到曲面上的图的染色问题及其在复杂网络中的应用,2013/10-2015/10,参加(位次3)

9. 国家自然科学基金项目,10771200,组合合作对策算法研究,2008/01-2010/12,参加(位次3)

发表文章及论著

1. Suning Gong, Qingqin Nong*, Tao Sun, Qizhi Fang, Dingzhu Du, Xiaoyu Shao. Maximize a Monotone Function with a Generic Submodularity Ratio, Theoretical Computer Science, 2021, 853: 16-24 (SCI四区)

2. 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, Theoretical Computer Science, 2020, 803: 82-93. (SCI四区)

3. Qingqin Nong, Jiazhu Fang, Suning Gong*, Dingzhu Du, Yan Feng, Xiaoying Qu. A 1/2-Approximation Algorithm for Maximizing a Non-monotone Weak-submodular Function on a Bounded Integer Lattice, Journal of Combinatorial Optimization, 2020, 39: 1208-1220. (SCI三区)

4. Qingqin Nong*, Jiazhu Fang, Suning Gong, Yan Feng, Xiaoying Qu. A Fast Algorithm for Maximizing a Non-monotone DR-submodular Integer Lattice Function, Theoretical Computer Science, 2020, 840: 177-186. (SCI四区)

5. Qingqin Nong, Suning Gong*, Qizhi Fang, Dingzhu Du. A Survey on Double GreedyAlgorithms for Maximizing Non-monotone Submodular Functions, Lecture Notes in Computer Science, Complexity and Approximation, 2020, 12000: 172-186.

6. Suning GongQingqin Nong*Wenjing LiuQizhi Fang. Parametricmonotone functionmaximization withmatroid constraints. Journal of Global Optimization. 75:833–849, 2019. (SCI二区)

7. Qingqin Nong, Jiapeng Wang, Suning Gong and Saijun GuoA bin packing game with cardinality constraintsunder the best cost ruleDiscrete Mathematics, Algorithms and Applications, 11(2):1950022, 2019.

8. 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. (SCI三区)

9. 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). (SCI四区)

10. 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. (SCI三区)

11. 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. (SCI三区)

12. 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.

13. 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)

14. 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. (SCI二区)

15. 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. (SCI四区)

16. 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.  (SCI四区)

17. Qingqin NongJinjiang Yuan*, Ruyan Fu, Lin Lin and Ji Tian. The single machine parallel batch on-line scheduling problem with family jobs to minimize makespan.International Journal of Production Economics, 2008, 111: 435-440. (SCI二区)

18. Q.Q. NongC.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, Operations Research Letters, 36(1): 61-66. (SCI四区)

19. Q.Q. NongT.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.  SCI四区)

  

  

  

  


地址:青岛市崂山区松岭路238号   
电话:0532-66787153
邮编:266100
版权所有©中国海洋大学     永利总站ylzz55|首頁|欢迎您     鲁ICP备05002467号-1     鲁公网安备 37021202000030号

官方微信

.