余炜

余炜

教授、士生导师

招生专业:数学

教授课程:高等数学(本科)、线性代数(本科)、组合最优化(研究生)、排序理论和算法(研究生)、最优化方法(研究生)

办公地点:徐汇校区第八教学楼6608

Emailyuwei@ecust.edu.cn


一、主要学习及工作经历

20056月,南昌大学数学系本科毕业,学士

20106月,华东理工大学应用数学专业研究生毕业,博士

20109-20128月,浙江大学计算机学院博士后

20122-20124月,香港科技大学计算机系,访问学者

20161-20171月,多伦多大学管理系,访问学者

20129-20147月,华东理工大学手机网投大平台讲师

20147-至今,华东理工大学手机网投大平台教授

二、主要研究方向

1. 运筹优化

2. 组合最优化

3. 近似算法

4. 算法博弈论

三、主要学术(教学)成果

1. 2019年度上海市自然科学奖二等奖,新型排序问题的理论与算法研究

2. 国家自然科学基金青年项目,网络上的排序问题的近似算法研究,1130118423万,2014/01-2016/12,主持

3. 上海市自然科学基金面上项目,无线传感器网络中扫描覆盖问题的近似算法研究,19ZR141180020万,2019/07-2022/06,主持

4. 中央高校基本科研业务费探索研究基金项目,2222018402816万,2018/01-2019/12,主持

5. 国家自然科学基金面上项目,物流问题驱动的网络排序研究,1187121352万,2019/01-2022/12,参加

6. 国家自然科学基金面上项目,一些路线和调度问题的算法与理论研究,1167113548万,2017/01-2020/12,参加

7. 国家自然科学基金面上项目,加工与运输协同供应链排序的复杂性与算法研究,62万,2014/01-2017/12,参加

四、代表性论文

1. Yuying Mao, Wei Yu*, Zhaohui Liu, Jiafeng Xiong, Approximation algorithms some minimum postmen cover problems. Discrete Applied Mathematics, 2022, https://doi.org/10.1016/j.dam.2022.01.005

2. Wei Yu*, Zhaohui Liu, Xiaoguang Bao, Approximation algorithms for some min-max postmen cover problems.Annals of Operations Research, 300, 267-287 (2021)

3. Wei Yu, Guochuan Zhang*, Mordecai Golin, Scheduling on a Graph with Release Times, Journal of Scheduling, 2021, https://doi.org/10.1007/s10951-021-00680-z

4. Wei Yu*, Zhaohui Liu, Xiaoguang Bao, New LP Relaxations for Minimum Cycle/Path/Tree Cover Problems. Theoretical Computer Science, 803, 71-81 (2020)

5. Wei Yu*, Zhaohui Liu, Xiaoguang Bao,Distance Constrained Vehicle Routing Problem to Minimize the Total Cost: Algorithms and Complexity. Journal of Combinatorial Optimization, 2020, https://doi.org/10.1007/s10878-020-00669-y

6. Igor Averbakh*Wei Yu, Multi-depot traveling salesmen location problems on networks with special structure. Annals of Operations Research, 286, 635-648 (2020)

7. Wei Yu*, Zhaohui Liu, Better Approximability Results for Min-Max Tree/Cycle/Path Cover Problems, Journal of Combinatorial Optimization, 37, 563-578 (2019)

8. Wei Yu*, Zhaohui Liu, Xiaoguang Bao, New Approximation Algorithms for the Minimum Cycle Cover Problem. Theoretical Computer Science, 793, 44-58 (2019)

9. Yukun Cheng, Qiaoming Han*, Wei Yu, Guochuan Zhang, Strategy-proof mechanisms for obnoxious facility game with bounded service range. Journal of Combinatorial Optimization, 37, 737-755 (2019)

10. Wei Yu, Zhaohui Liu*, Improved approximation algorithms for some min-max and minimum cycle cover problems. Theoretical Computer Science, 654, 45-58 (2016)

11. Wei Yu, Zhaohui Liu*, Vehicle routing problems with regular objective functions on a path. Naval Research Logistics,  61(1), 34-43 (2014)

12. Wei Yu, Zhaohui Liu*, Xiaoguang Bao, Optimal deterministic algorithms for some variants of online quota traveling salesman problem. European Journal of Operational Research, 238, 735-740 (2014)

13. Yukun Cheng, Wei Yu, Guochuan Zhang*, Strategy-proof approximation mechanisms for an obnoxious facility game on networks. Theoretical Computer Science, 497, 154-163 (2013)

14. Wei Yu, Guochuan Zhang*, Improved approximation algorithms for routing shop scheduling. Lecture Notes in Computer Science, 7074, 30-39 (2011)

15. Wei Yu, Zhaohui Liu*, Leiyang Wang, Tijun Fan, Routing flow shop and open shop scheduling problems, European Journal of Operational Research, 213, 24-36 (2011)

16. Wei Yu, Zhaohui Liu*, Single-vehicle scheduling problems with release and service times on a line. Networks, 57, 128-134 (2011)

17.Wei Yu, Zhaohui Liu*, Vehicle routing problems on a line-shaped network with release time constraints. Operations Research Letters, 37, 85-88 (2009)

五、学术兼职(或荣誉奖励)

美国《数学评论》评论员,期刊《Mathematical Programming》、《Algorithmica》、《Computers & Industrial Engineering》、《Theoretical Computer Science》、《Journal of Combinatorial Optimization》、《IEEE/ACM Transactions on Networking》审稿人,获得2020年中国运筹学会排序分会学术交流会最佳论文、2019年度上海市自然科学奖二等奖、2019华东理工大学年度考核优秀、华东理工大学“2018青年英才培育计划”、华东理工大学“2015年度优秀青年教师培育计划”

网页发布时间: 2021-10-07