姓名: 葛冬冬
最后学位: 博士
职称: 教授
公共职务: 副院长
导师岗位: 博导
办公室: 404
电话: 65901671
Email: ge.dongdong@mail.shufe.edu.cn
个人简介

Dongdong Ge is a professor in Management Science in Shanghai University of Finance and Economics. He is the dean of Research Institute for Interdisciplinary Sciences and a vice dean of the school of Information Management and Engineering. He received his PhD from Stanford MS&E in 2009. His main research interests lie in large scale optimization theory and algorithms, and operations management. He published papers in OR and CS journals and conferences such as Mathematics of Operation Research, Mathematical Programming, FOCS, SODA, EC, ICML and etc. He has been widely consulting for companies such as Boeing, Google, IBM, JD, SFExpress, Didi, Netease, and etc.


葛冬冬,教授,博导,上财交叉科学院院长(http://riis.shufe.edu.cn/);中国运筹学会理事;中国运筹学会数学规划分会青年理事会副主任;上海财经大学学术委员会委员。

2009年在斯坦福大学管理科学与工程系获博士学位,导师叶荫宇教授。曾任上海交通大学安泰经济与管理学院副教授,博士生导师。

主要研究兴趣:1,大规模优化问题的理论与计算:超大规模机器学习,统计学习,数学规划等问题的并行与分布计算平台开发。2,数据驱动的管理学问题研究,供应链管理,健康管理。人工智能与管理学交叉领域研究。

在管理与运筹,优化理论,计算机理论科学,机器学习等多个顶级期刊和会议上,如Mathematics of Operation Research, Mathematical Programming, FOCS, SODA, EC, ICML 等发表过论文。担任过多个国际著名期刊的特约审稿。参与过滴滴,京东,唯品会,波音,谷歌,顺丰,网易金融,上海通用等国内外公司的多个优化咨询项目。
教授课程

高等运筹与优化理论,博士必修。

优化理论与物流管理,硕士选修。

量化管理科学,新生研讨课。

线性与非线性优化,试点班必修课。

计算复杂度理论与算法设计,试点班必修课。

 

科研项目
主持过国家自然科学基金面上项目和青年项目,浦江人才计划,上财创新群体基金负责人等基金。
教育背景

2013-今,上海财经大学信管学院,教授。

2009-2013,上海交通大学安泰经管学院,讲师,副教授,博导。

2009年,斯坦福大学,管理科学与工程系,运筹学博士。

2001年,纽约州立大学石溪分校,数学硕士

1999年,南开大学,数学学士

发表论文
  1. An improved algorithm for the L2 – Lp minimization problem.
    D. Ge, R. He, S. He.
    Mathematical Programming, 2017.

  2. A Note on Appointment Scheduling with Piecewise Linear Cost Functions.
    D. Ge, G. Wan, Z. Wang, J. Zhang.
    Mathematics of Operations Research, 39 (4), 1244-1251, 2014.

  3. Complexity of Unconstrained L2 – Lp Minimization.
    X. Chen, D. Ge, Z. Wang, Y. Ye.
    Mathematical Programming, 143.1-2: 371-383, 2014.

  4. A Note on Complexity of Lp Minimization.
    D. Ge, X. Jiang, Y. Ye.
    Mathematical Programming. Volume 129, Number 2, 285-299, 2011.

  5. On Equivalence of Semidefinite Relaxations for Quadratic Matrix Programming.
    Y. Ding, D. Ge, H. Wolkowicz.
    Mathematics of Operations Research, Vol. 36, No. 1, pp. 88-104, 2011.


Conferences

  1. A non-asymptotic approach to analyzing kidney exchange graphs.
    Ding Y, Ge D, He S, Ryan CT
    In Proceedings of the Sixteenth ACM Conference on Economics and Computation(EC) 2015.

  2. The Cost of Cache-Oblivious Searching.
    M. A. Bender, G. S. Brodal, R. Fagerberg, D. Ge, S. He, H. Hu, J. Iacono, and A. Lopez-Ortiz
    Proceedings of the 44th Annual Symposium on Foundations of Computer Science (FOCS) , pages 271-280, 2003.

  3. Improved Approximation Algorithms for the Freeze-Tag Problem.
    E. Arkin, M. A. Bender, D. Ge, S. He, and J. Mitchell.
    Proceedings of the 15th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pages 295-303, 2003.

  4. Sorting by Length-Weighted Reversals: Dealing with Signs and Circularity.
    F. Swidan, M. A. Bender, D. Ge, S. He, H. Hu, and R. Pinter.
    Proceedings of the 15th Annual Combinatorial Pattern Matching Symposium (CPM), Volume 3109 of Lecture Notes in Computer Science, pages 32-46, 2004.

  5. Improved Bounds on Sorting with Length-Weighted Reversals.
    M. A. Bender, D. Ge, S. He, H. Hu, R. Pinter, S. Skiena, and F. Swidan.
    Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 912-921, 2004.

荣誉奖励

2016年中国运筹学会青年科技奖

第三届上海财经大学学术奖。

2014年IBM中国区访问学者Excellent Project Award。