-

检索结果分析

署名顺序

ESI高水平论文

结果分析中...

成果/Result

已选条件:
  • 收录类型=EI x
  • 人物=余炜 x

40 条 记 录,以下是 1-30

视图:
排序方式:
共2页<< <12> >>每页显示条目数:
Approximation algorithms for some Minimum Postmen Cover Problems被引量:35收藏 分享
作者:Mao, Yuying Yu, Wei Liu, Zhaohui Xiong, Jiafeng
机构: Department of Mathematics
来源:Discrete Applied Mathematics  2022
关键词:Approximation algorithms - Undirected graphs  
Approximation Algorithms for Some Minimum Postmen Cover Problems被引量:26收藏 分享
作者:Mao, Yuying Yu, Wei Liu, Zhaohui Xiong, Jiafeng
机构: Department of Mathematics
来源:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)  2019
关键词:Undirected graphs - Approximation algorithms  
Better Inapproximability Bounds and Approximation Algorithms for Min-Max Tree/Cycle/Path Cover Problems被引量:26收藏 分享
作者:Yu, Wei Liu, Zhaohui
机构: Department of Mathematics
来源:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)  2017
关键词:Forestry - Combinatorial optimization - Undirected graphs - Traveling salesman problem - Trees (mathematics)  
ON DECOMPOSITION OF THE TOTAL TARDINESS PROBLEM被引量:25收藏 分享
作者:Chang, S. Lu, Q. Tang, G. Yu, W.
机构:E CHINA UNIV SCI & TECHNOL;WUHAN UNIV;SHANGHAI SECOND POLYTECH UNIV
来源:OPERATIONS RESEARCH LETTERS  1995
关键词:SCHEDULING THEORY   ONE-MACHINE TOTAL TARDINESS PROBLEM   DECOMPOSITION THEOREM   BACKWARD SHIFT  
Improved approximation algorithms for some min-max and minimum cycle cover problems被引量:20收藏 分享
作者:Yu, Wei Liu, Zhaohui
机构: Department of Mathematics
来源:Theoretical Computer Science  2016
关键词:Costs - Undirected graphs - Routing algorithms - Traveling salesman problem - Vehicle routing  
New LP relaxations for minimum cycle/path/tree cover problems被引量:20收藏 分享
作者:Yu, Wei Liu, Zhaohui Bao, Xiaoguang
机构: Department of Mathematics; College of Information Technology
来源:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)  2018
关键词:Routing algorithms - Forestry - Undirected graphs - Vehicle routing  
Improved approximation algorithms for min-max and minimum vehicle routing problems被引量:18收藏 分享
作者:Yu, Wei Liu, Zhaohui
机构: Department of Mathematics
来源:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)  2015
关键词:Undirected graphs - Vehicle routing - Routing algorithms - Traveling salesman problem - Costs  
Routing open shop and flow shop scheduling problems被引量:18收藏 分享
作者:Yu, Wei Liu, Zhaohui Wang, Leiyang Fan, Tijun
机构:E China Univ Sci & Technol;E China Univ Sci & Technol
来源:EUROPEAN JOURNAL OF OPERATIONAL RESEARCH  2011
关键词:Scheduling   Routing   Open shop   Flow shop   Complexity   Approximation algorithm  
Distance Constrained Vehicle Routing Problem to Minimize the Total Cost被引量:17收藏 分享
作者:Yu, Wei Liu, Zhaohui Bao, Xiaoguang
机构: Department of Mathematics; College of Information Technology
来源:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)  2019
关键词:Routing algorithms - Undirected graphs - Approximation algorithms - Trees (mathematics) - Vehicles  
Approximation Algorithms for the Maximum-WEIght Cycle/Path Packing Problems被引量:16收藏 分享
作者:Li, Shiming Yu, Wei
机构:East China Univ Sci & Technol
来源:ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH  2023
关键词:Approximation algorithm   cycle packing   path packing   triangle inequality  
New approximation algorithms for the minimum cycle cover problem被引量:16收藏 分享
作者:Yu, Wei Liu, Zhaohui Bao, Xiaoguang
机构:East China Univ Sci & Technol;Shanghai Ocean Univ
来源:THEORETICAL COMPUTER SCIENCE  2019
关键词:Vehicle routing   Cycle cover   Traveling Salesman Problem   Approximation algorithm  
Single-Vehicle Scheduling Problems with Release and Service Times on a Line被引量:14收藏 分享
作者:Yu, Wei Liu, Zhaohui
机构:E China Univ Sci & Technol
来源:NETWORKS  2011
关键词:vehicle routing   vehicle scheduling   approximation algorithm  
Better approximability results for min-max tree/cycle/path cover problems被引量:13收藏 分享
作者:Yu, Wei Liu, Zhaohui
机构:East China Univ Sci & Technol
来源:JOURNAL OF COMBINATORIAL OPTIMIZATION  2019
关键词:Approximation hardness   Approximation algorithm   Tree cover   Cycle cover   Path cover   Traveling salesman problem  
Vehicle routing problems on a line-shaped network with release time constraints被引量:12收藏 分享
作者:Yu, Wei Liu, Zhaohui
机构:E China Univ Sci & Technol
来源:OPERATIONS RESEARCH LETTERS  2009
关键词:Vehicle routing   Vehicle scheduling   Line-shaped network  
New approximation algorithms for the minimum cycle cover problem被引量:12收藏 分享
作者:Yu, Wei Liu, Zhaohui Bao, Xiaoguang
机构: Department of Mathematics; College of Information Technology
来源:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)  2018
关键词:Routing algorithms - Undirected graphs - Vehicle routing - Traveling salesman problem  
A note on approximation algorithms of the clustered traveling salesman problem被引量:9收藏 分享
作者:Bao, Xiaoguang Liu, Zhaohui Yu, Wei Li, Ganggang
机构:Shanghai Ocean Univ;East China Univ Sci & Technol;Jiangxi Univ Finance & Econ
来源:INFORMATION PROCESSING LETTERS  2017
关键词:Traveling salesman problem   Clustered traveling salesman problem   Approximation algorithms  
Exact and Approximation Algorithms for the Multi-Depot Capacitated Arc Routing Problems被引量:9收藏 分享
作者:Yu, Wei Liao, Yujie Yang, Yichen
机构:East China Univ Sci & Technol;Sabre Inc
来源:TSINGHUA SCIENCE AND TECHNOLOGY  2023
关键词:approximation algorithm   multi-depot   vehicle routing problem   arc routing problem   rural postman problem  
Optimal deterministic algorithms for some variants of Online Quota Traveling Salesman Problem被引量:7收藏 分享
作者:Yu, Wei Liu, Zhaohui Bao, Xiaoguang
机构:E China Univ Sci & Technol;Shanghai Ocean Univ
来源:EUROPEAN JOURNAL OF OPERATIONAL RESEARCH  2014
关键词:Traveling salesman   Quota TSP   Online algorithm   Competitive ratio  
A local search algorithm for the k-path partition problem被引量:6收藏 分享
作者:Li, Shiming Yu, Wei Liu, Zhaohui
机构:East China Univ Sci & Technol
来源:OPTIMIZATION LETTERS  2024
关键词:Approximation algorithm   Path partition   Set covering   Local search  
Approximation algorithms for the min-max clustered k-traveling salesmen problems被引量:6收藏 分享
作者:Bao, Xiaoguang Xu, Lei Yu, Wei Song, Wei
机构:Shanghai Ocean Univ;East China Univ Sci & Technol
来源:THEORETICAL COMPUTER SCIENCE  2022
关键词:Approximation algorithm   Min-max   Traveling salesman problem   Clustered traveling salesman problem  
Approximation algorithms for the k-depots Hamiltonian path problem被引量:6收藏 分享
作者:Yang, Yichen Liu, Zhaohui Yu, Wei
机构:East China Univ Sci & Technol
来源:OPTIMIZATION LETTERS  2022
关键词:Hamiltonian path problem   Approximation algorithm   Multiple salesmen   Multiple depots   Christofides-like heuristic  
Approximation Algorithms for Multi-vehicle Stacker Crane Problems被引量:5收藏 分享
作者:Yu, Wei Dai, Rui-Yong Liu, Zhao-Hui
机构:East China Univ Sci & Technol
来源:JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF CHINA  2023
关键词:Approximation algorithm   Vehicle routing problem   Stacker Crane Problem   Pickup and delivery problem  
Improved approximation algorithms for some min-max postmen cover problems with applications to the min-max subtree cover被引量:5收藏 分享
作者:Yu, Wei
机构:East China Univ Sci & Technol
来源:MATHEMATICAL METHODS OF OPERATIONS RESEARCH  2023
关键词:Approximation algorithm   Rural Postman problem   Chinese Postman problem   Rural Postmen cover   Min-max objective  
Vehicle Routing Problems with Regular Objective Functions on a Path被引量:4收藏 分享
作者:Yu, Wei Liu, Zhaohui
机构:E China Univ Sci & Technol
来源:NAVAL RESEARCH LOGISTICS  2014
关键词:vehicle routing   vehicle scheduling   regular objective   complexity  
Approximation algorithms for some min-max and minimum stacker crane cover problems被引量:3收藏 分享
作者:Sun, Yuhui Yu, Wei Liu, Zhaohui
机构:East China Univ Sci & Technol
来源:JOURNAL OF COMBINATORIAL OPTIMIZATION  2023
关键词:Approximation algorithm   Stacker crane problem   Rural postman problem   Traveling salesman problem   Stacker crane cover  
Improved approximation algorithms for the k-path partition problem被引量:3收藏 分享
作者:Li, Shiming Yu, Wei Liu, Zhaohui
机构:East China Univ Sci & Technol
来源:JOURNAL OF GLOBAL OPTIMIZATION  2024
关键词:Approximation algorithm   Path partition problem   Maximum traveling salesman problem   Local search  
Distance constrained vehicle routing problem to minimize the total cost: algorithms and complexity被引量:2收藏 分享
作者:Yu, Wei Liu, Zhaohui Bao, Xiaoguang
机构:East China Univ Sci & Technol;Shanghai Ocean Univ
来源:JOURNAL OF COMBINATORIAL OPTIMIZATION  2022
关键词:Vehicle routing   Cycle cover   Path cover   Approximation algorithm   Complexity   Integrality gap  
Approximation Algorithms for the Min-Max Mixed Rural Postmen Cover Problem and Its Variants被引量:2收藏 分享
作者:Huang, Liting Yu, Wei Liu, Zhaohui
机构:East China Univ Sci & Technol
来源:ALGORITHMICA  2024
关键词:Approximation algorithm   Mixed Chinese postman problem   Mixed rural postman problem   Stacker crane problem   Postmen cover  
New LP relaxations for Minimum Cycle/Path/Tree Cover Problems被引量:2收藏 分享
作者:Yu, Wei Liu, Zhaohui Bao, Xiaoguang
机构:East China Univ Sci & Technol;Shanghai Ocean Univ
来源:THEORETICAL COMPUTER SCIENCE  2020
关键词:Vehicle routing   Cycle cover   Path cover   Approximation algorithm   Integrality gap  
Approximation and polynomial algorithms for the data mule scheduling with handling time and time span constraints被引量:2收藏 分享
作者:Yu, Wei Liu, Zhaohui
机构:East China Univ Sci & Technol
来源:INFORMATION PROCESSING LETTERS  2022
关键词:data mule scheduling   handling time   time span constraint   approximation algorithms   polynomial algorithms  
已选条目 检索报告 聚类工具

版权所有©华东理工大学 重庆维普资讯有限公司 渝B2-20050021-7 
渝公网安备 50019002500408号 违法和不良信息举报中心