Minimum Clique Partition Problem with Constrained Weight for Interval Graphs. - Jianbo Li; Mingxia Chen; Jianping Li 007; Weidong Li 002 (COCOON, 2006)

Some approximation algorithms for the clique partition problem in weighted interval graphs. - Mingxia Chen; Jianbo Li; Jianping Li 007; Weidong Li 002; Lusheng Wang 001 (Theor. Comput. Sci., 2007)

Polynomial Approximation Schemes for the Max-Min Allocation Problem under a grade of Service Provision. - Jianping Li 007; Weidong Li 002; Jianbo Li (Discret. Math. Algorithms Appl., 2009)

An improved approximation algorithm for the ATSP with parameterized triangle inequality. - Tongquan Zhang; Weidong Li 002; Jianping Li 007 (J. Algorithms, 2009)

The subdivision-constrained minimum spanning tree problem. - Jianping Li 007; Weidong Li 002; Tongquan Zhang; Zhongxu Zhang (Theor. Comput. Sci., 2009)

Two Approximation Schemes for Scheduling on Parallel Machines under a grade of Service Provision. - Weidong Li 002; Jianping Li 007; Tongquan Zhang (Asia Pac. J. Oper. Res., 2012)

A polynomial time approximation scheme for embedding a directed hypergraph on a weighted ring. - Jianping Li 007; Weidong Li 002; Lusheng Wang 001 (J. Comb. Optim., 2012)

On the maximum TSP with γ-parameterized triangle inequality. - Weidong Li 002; Yaomin Shi (Optim. Lett., 2012)

Parallel-Machine Scheduling Problem under the Job Rejection Constraint - (Extended Abstract). - Weidong Li 002; Jianping Li 007; Xuejie Zhang 002; Zhibin Chen (FAW, 2014)

Approximation algorithms for the ring loading problem with penalty cost. - Weidong Li 002; Jianping Li 007; Li Guan (Inf. Process. Lett., 2014)

The subdivision-constrained routing requests problem. - Jianping Li 007; Weidong Li 002; Junran Lichen (J. Comb. Optim., 2014)

Approximation algorithms for $k$ -partitioning problems with partition matroid constraint. - Weidong Li 002; Jianping Li 007 (Optim. Lett., 2014)

Dynamic Fair Division of Multiple Resources with Satiable Agents in Cloud Computing Systems. - Xi Liu 002; Xiaolu Zhang; Xuejie Zhang 002; Weidong Li 002 (BDCloud, 2015)

A Task-Type-Based Algorithm for the Energy-Aware Profit Maximizing Scheduling Problem in Heterogeneous Computing Systems. - Weidong Li 002; Xi Liu 002; Xuejie Zhang 002; Xiaobo Cai (CCGRID, 2015)

The Directed Ring Loading with Penalty Cost. - Li Guan; Jianping Li 007; Xuejie Zhang 002; Weidong Li 002 (WALCOM, 2015)

A note on dynamic fair division of multiple resources. - Weidong Li 002; Xi Liu 002; Xiaolu Zhang; Xuejie Zhang 002 (CoRR, 2015)

Dynamic fair allocation of multiple resources with bounded number of tasks in cloud computing systems. - Weidong Li 002; Xi Liu 002; Xiaolu Zhang; Xuejie Zhang 002 (Multiagent Grid Syst., 2015)

Penalty cost constrained identical parallel machine scheduling problem. - Weidong Li 002; Jianping Li 007; Xuejie Zhang 002; Zhibin Chen (Theor. Comput. Sci., 2015)

Discrete Interior Search Algorithm for Multi-resource Fair Allocation in Heterogeneous Cloud Computing Systems. - Xi Liu 002; Xiaolu Zhang; Weidong Li 002; Xuejie Zhang 002 (ICIC (1), 2016)

Approximations for constructing tree-form structures using specific material with fixed length. - Jianping Li 007; Li Guan; Honglin Ding; Weidong Li 002 (Optim. Lett., 2016)

The Prize-collecting Call Control Problem on Weighted Lines and Rings. - Weidong Li 002; Jianping Li 007; Li Guan; Yaomin Shi (RAIRO Oper. Res., 2016)

Implementation of Ant Colony Optimization Combined with Tabu Search for Multi-resource Fair Allocation in Heterogeneous Cloud Computing. - Xi Liu 002; Xiaolu Zhang; Qianna Cui; Weidong Li 002 (BigDataSecurity/HPSC/IDS, 2017)

Approximation Algorithms for the Generalized Stacker Crane Problem. - Jianping Li 007; Xiaofei Liu; Weidong Li 002; Li Guan; Junran Lichen (COCOA (1), 2017)

A Further Analysis of the Dynamic Dominant Resource Fairness Mechanism. - Weidong Li 002; Xi Liu 002; Xiaolu Zhang; Xuejie Zhang 002 (FAW, 2017)

A Profit-Maximum Resource Allocation Approach for Mapreduce in Data Centers. - Xiaolu Zhang; Weidong Li 002; Xi Liu 002; Xuejie Zhang 002 (GPC, 2017)

Multi-resource Fair Allocation with Bounded Number of Tasks in Cloud Computing Systems. - Weidong Li 002; Xi Liu 002; Xiaolu Zhang; Xuejie Zhang 002 (NCTCS, 2017)

A Polynomial Time Approximation Scheme for the Closest Shared Center Problem. - Weidong Li 002; Lusheng Wang 001; Wenjuan Cui (Algorithmica, 2017)

Swarm optimization algorithms applied to multi-resource fair allocation in heterogeneous cloud computing systems. - Xi Liu 002; Xiaolu Zhang; Weidong Li 002; Xuejie Zhang 002 (Computing, 2017)

Semi-online Hierarchical Scheduling for Bag-of-tasks on Two Machines. - Bingfei Dai; Jianping Li 007; Weidong Li 002 (CSAI/ICIMT, 2018)

Multi-choice Virtual Machine Allocation with Time Windows in Cloud Computing. - Jixian Zhang; Ning Xie; Xuejie Zhang 002; Weidong Li 002 (GPC, 2018)

Semi-online Machine Covering on Two Hierarchical Machines with Discrete Processing Times. - Gangxiong Wu; Weidong Li 002 (NCTCS, 2018)

Vector scheduling with rejection on a single machine. - Weidong Li 002; Qianna Cui (4OR, 2018)

An online auction mechanism for cloud computing resource allocation and pricing based on user evaluation and cost. - Jixian Zhang; Ning Xie; Xuejie Zhang 002; Weidong Li 002 (Future Gener. Comput. Syst., 2018)

Strategy-Proof Mechanism for Provisioning and Allocation Virtual Machines in Heterogeneous Clouds. - Xi Liu 002; Weidong Li 002; Xuejie Zhang 002 (IEEE Trans. Parallel Distributed Syst., 2018)

A Primal Dual Approximation Algorithm for the Multicut Problem in Trees with Submodular Penalties. - Xiaofei Liu; Weidong Li 002 (AAIM, 2019)

Trade-off Between Energy Consumption and Makespan in the Mapreduce Resource Allocation Problem. - Xiaolu Zhang; Xi Liu 002; Weidong Li 002; Xuejie Zhang 002 (ICAIS (2), 2019)

Semi-online Machine Covering on Two Hierarchical Machines with Known Total Size of Low-Hierarchy Jobs. - Man Xiao; Gangxiong Wu; Weidong Li 002 (NCTCS, 2019)

Improved approximation algorithms for the combination problem of parallel machine scheduling and path. - Li Guan; Jianping Li 007; Weidong Li 002; Junran Lichen (J. Comb. Optim., 2019)

Approximation algorithm for the energy-aware profit maximizing problem in heterogeneous computing systems. - Weidong Li 002; Xi Liu 002; Xiaobo Cai; Xuejie Zhang 002 (J. Parallel Distributed Comput., 2019)

A Truthful Auction Mechanism for Cumulative Resource Allocation in Mobile Edge Computing. - Xutao Yang; Xuejie Zhang 002; Weidong Li 002; Jixian Zhang (HP3C, 2020)

Semi-online Algorithms for Hierarchical Scheduling on Three Parallel Machines with a Buffer Size of 1. - Man Xiao; Lu Ding; Shu Zhao; Weidong Li 002 (NCTCS, 2020)

Improved approximation schemes for early work scheduling on identical parallel machines with common due date. - Weidong Li 002 (CoRR, 2020)

An online auction mechanism for time-varying multidimensional resource allocation in clouds. - Jixian Zhang; Xutao Yang; Ning Xie; Xuejie Zhang 002; Athanasios V. Vasilakos; Weidong Li 002 (Future Gener. Comput. Syst., 2020)

Vector scheduling with rejection on two machines. - Bingfei Dai; Weidong Li 002 (Int. J. Comput. Math., 2020)

Approximation Algorithms for the Maximum Bounded Connected Bipartition Problem. - Yajie Li; Weidong Li 002; Xiaofei Liu; Jinhua Yang (AAIM, 2021)

Semi-online Early Work Maximization Problem on Two Hierarchical Machines with Partial Information of Processing Time. - Man Xiao; Xiaoqiao Liu; Weidong Li 002 (AAIM, 2021)

Online Bottleneck Semi-matching. - Man Xiao; Shu Zhao; Weidong Li 002; Jinhua Yang (COCOA, 2021)

Strategy-proof mechanism for time-varying batch virtual machine allocation in clouds. - Jixian Zhang; Ning Xie; Xutao Yang; Xuejie Zhang 002; Weidong Li 002 (Clust. Comput., 2021)

Strategy-Proof Mechanism for Online Time-Varying Resource Allocation with Restart. - Jixian Zhang; Ning Xie; Xuejie Zhang 002; Weidong Li 002 (J. Grid Comput., 2021)

Online algorithms for the mixed ring loading problem with two nodes. - Li Guan; Weidong Li 002; Man Xiao (Optim. Lett., 2021)

Approximation algorithms for the multiprocessor scheduling with submodular penalties. - Xiaofei Liu; Weidong Li 002 (Optim. Lett., 2021)

On-line Single Machine Scheduling with Release Dates and Submodular Rejection Penalties. - Xiaofei Liu; Yaoyu Zhu; Weidong Li 002; Lei Ma 008 (AAIM, 2022)

Online Early Work Maximization Problem on Two Hierarchical Machines with Buffer or Rearrangements. - Man Xiao; Xihua Bai; Weidong Li 002 (AAIM, 2022)

Online Semi-matching Problem with Two Heterogeneous Sensors in a Metric Space. - Man Xiao; Weidong Li 002 (COCOON, 2022)

An Approximation Algorithm for the H-Prize-Collecting Power Cover Problem. - Han Dai; Weidong Li 002; Xiaofei Liu (FAW, 2022)

Online Early Work Maximization on Three Hierarchical Machines with a Common Due Date. - Man Xiao; Weidong Li 002 (FAW, 2022)

A Local-Ratio-Based Power Control Approach for Capacitated Access Points in Mobile Edge Computing. - Qinghui Zhang; Weidong Li 002; Qian Su; Xuejie Zhang 002 (HP3C, 2022)

Maximin Share Based Mechanisms for Multi-resource Fair Allocation with Divisible and Indivisible Tasks. - Bin Deng; Weidong Li 002 (NCTCS, 2022)

Multi-resource Allocation in Mobile Edge Computing Systems: A Trade-Off on Fairness and Efficiency. - Xingxing Li; Weidong Li 002; Xuejie Zhang 002 (NCTCS, 2022)

A Modified List Scheduling Algorithm for the Online Hierarchical Load Balancing Problem with Bounded Processing Times. - Man Xiao; Weidong Li 002 (NCTCS, 2022)

An Approximation Algorithm for the B-prize-collecting Multicut Problem in Trees. - Xiaofei Liu; Weidong Li 002 (TAMC, 2022)

Meta-Heuristic Algorithms for the Generalized Extensible Bin Packing Problem With Overload Cost. - Ran Ding; Bin Deng; Weidong Li 002 (IEEE Access, 2022)

Generalized asset fairness mechanism for multi-resource fair allocation mechanism with two different types of resources. - Xuejie Zhang 002; Jie Li; Guibing Li; Weidong Li 002 (Clust. Comput., 2022)

Online Bottleneck Matching Problem with Two Heterogeneous Sensors in a Metric Space. - Man Xiao; Yaru Yang; Weidong Li 002 (Comput., 2022)

Strategy-proof mechanism for online resource allocation in cloud and edge collaboration. - Jixian Zhang; Laixin Chi; Ning Xie; Xutao Yang; Xuejie Zhang 002; Weidong Li 002 (Computing, 2022)

A Primal-Dual Based Power Control Approach for Capacitated Edge Servers. - Qinghui Zhang; Weidong Li 002; Xuejie Zhang 002 (CoRR, 2022)

Truthful auction mechanisms for resource allocation in the Internet of Vehicles with public blockchain networks. - Jixian Zhang; Wenlu Lou; Hao Sun; Qian Su; Weidong Li 002 (Future Gener. Comput. Syst., 2022)

A note on the minimum power partial cover problem on the plane. - Han Dai; Bin Deng; Weidong Li 002; Xiaofei Liu (J. Comb. Optim., 2022)

Combinatorial approximation algorithms for the submodular multicut problem in trees with submodular penalties. - Xiaofei Liu; Weidong Li 002 (J. Comb. Optim., 2022)

A primal-dual approximation algorithm for the k-prize-collecting minimum power cover problem. - Xiaofei Liu; Weidong Li 002; Runtao Xie (Optim. Lett., 2022)

A Primal-Dual-Based Power Control Approach for Capacitated Edge Servers. - Qinghui Zhang; Weidong Li 002; Qian Su; Xuejie Zhang 002 (Sensors, 2022)

Approximation algorithms for the minimum power cover problem with submodular/linear penalties. - Xiaofei Liu; Weidong Li 002; Han Dai (Theor. Comput. Sci., 2022)

A primal-dual approximation algorithm for the k-prize-collecting minimum vertex cover problem with submodular penalties. - Xiaofei Liu; Weidong Li 002; Jinhua Yang (Frontiers Comput. Sci., 2023)

Combinatorial approximation algorithms for the maximum bounded connected bipartition problem. - Xiaofei Liu; Yajie Li; Weidong Li 002; Jinhua Yang (J. Comb. Optim., 2023)

Multi-resource fair allocation with bandwidth requirement compression in the cloud-edge system. - Xingxing Li; Weidong Li 002; Xuejie Zhang 002 (Comput. Electr. Eng., 2023)

Online Mixed Ring Covering Problem with Two Nodes. - Man Xiao; Weidong Li 002; Xiaofei Liu (Oper. Res. Forum, 2023)

Algorithms for single machine scheduling problem with release dates and submodular penalties. - Xiaofei Liu; Man Xiao; Weidong Li 002; Yaoyu Zhu; Lei Ma 008 (J. Comb. Optim., 2023)

Online bottleneck matching on a line. - Man Xiao; Shu Zhao; Weidong Li 002; Jinhua Yang (J. Comb. Optim., 2023)

Extended efficiency and soft-fairness multiresource allocation in a cloud computing system. - Xingxing Li; Weidong Li 002; Xuejie Zhang 002 (Computing, 2023)

Bag-of-Tasks Scheduling with Rejection in Large Computing Systems. - Weidong Li 002 (Asia Pac. J. Oper. Res., 2023)

Semi-online early work maximization problems on two hierarchical uniform machines with partial information of processing time. - Man Xiao; Xiaoqiao Liu; Weidong Li 002 (J. Comb. Optim., 2023)

Multiresource fair allocation with time window constraints. - Xingxing Li; Weidong Li 002; Xuejie Zhang 002 (J. Supercomput., 2023)

Online and semi-online scheduling on two hierarchical machines with a common due date to maximize the total early work. - Man Xiao; Xiaoqiao Liu; Weidong Li 002; Xin Chen 057; Malgorzata Sterna; Jacek Blazewicz (Int. J. Appl. Math. Comput. Sci., 2024)

Truthful mechanism for joint resource allocation and task offloading in mobile edge computing. - Xi Liu 002; Jun Liu 081; Weidong Li 002 (Comput. Networks, 2024)

A truthful double auction mechanism for resource provisioning and elastic service in vehicle computing. - Xi Liu 002; Jun Liu 081; Weidong Li 002 (Comput. Networks, 2024)

Approximation algorithms for scheduling parallel machines with an energy constraint in green manufacturing. - Weidong Li 002; Jinwen Ou (Eur. J. Oper. Res., 2024)

Machine scheduling with restricted rejection: An Application to task offloading in cloud-edge collaborative computing. - Weidong Li 002; Jinwen Ou (Eur. J. Oper. Res., 2024)

Fair multiresource allocation with access constraint in cloud-edge systems. - Xingxing Li; Guangqin Hu; Weidong Li 002; Xuejie Zhang 002 (Future Gener. Comput. Syst., 2024)

A two-stage budget-feasible mechanism for mobile crowdsensing based on maximum user revenue routing. - Jixian Zhang; Xiyi Liao; Hao Wu 010; Weidong Li 002 (Future Gener. Comput. Syst., 2024)

An approximation algorithm for the -prize-collecting multicut problem in trees with submodular penalties. - Xiaofei Liu; Weidong Li 002 (Math. Struct. Comput. Sci., 2024)

Ordered Submodularity-Based Value Maximization of UAV Data Collection in Earthquake Areas. - Jixian Zhang; Zhemin Wang; Hao Wu 010; Weidong Li 002 (IEEE Trans. Netw. Sci. Eng., 2024)

Primal-Dual-Based Computation Offloading Method for Energy-Aware Cloud-Edge Collaboration. - Qian Su; Qinghui Zhang; Weidong Li 002; Xuejie Zhang 002 (IEEE Trans. Mob. Comput., 2024)

An Ordered Submodularity-Based Budget-Feasible Mechanism for Opportunistic Mobile Crowdsensing Task Allocation and Pricing. - Jixian Zhang; Yi Zhang; Hao Wu 010; Weidong Li 002 (IEEE Trans. Mob. Comput., 2024)

UAV Base Station Network Transmission-Based Reverse Auction Mechanism for Digital Twin Utility Maximization. - Jixian Zhang; Mingyi Zong; Athanasios V. Vasilakos; Weidong Li 002 (IEEE Trans. Netw. Serv. Manag., 2024)

Dynamic Multi-Resource Fair Allocation with Elastic Demands. - Hao Guo; Weidong Li 002 (J. Grid Comput., 2024)

Semi-Online Algorithms for the Hierarchical Extensible Bin-Packing Problem and Early Work Problem. - Yaru Yang; Man Xiao; Weidong Li 002 (Comput., 2024)

Lowest revenue limit-based truthful auction mechanism for cloud resource allocation. - Jixian Zhang; Hao Sun; Weidong Li 002 (J. Supercomput., 2024)

Double auction mechanisms in edge computing resource allocation for blockchain networks. - Ning Xie; Jixian Zhang; Xuejie Zhang 002; Weidong Li 002 (Clust. Comput., 2024)

A discrete dwarf mongoose optimization algorithm to solve task assignment problems on smart farms. - Minzhi Xu; Weidong Li 002; Xuejie Zhang 002; Qian Su (Clust. Comput., 2024)

A Novel Clinching Auction Mechanism for Edge Computing Resource Allocation With Budget Limits. - Jixian Zhang; Hao Sun; Zhemin Wang; Qian Su; Weidong Li 002 (Trans. Emerg. Telecommun. Technol., 2024)

A resource competition-based truthful mechanism for IoV edge computing resource allocation with a lowest revenue limit. - Jixian Zhang; Zhemin Wang; Athanasios V. Vasilakos; Weidong Li 002 (J. Cloud Comput., 2024)

Scheduling with a discounted profit criterion on identical machines. - Weidong Li 002; Yaru Yang; Man Xiao; Xin Chen 057; Malgorzata Sterna; Jacek Blazewicz (Discret. Appl. Math., 2025)

The generalized assignment problem with fixed processing times and uniform processing costs to minimize total cost. - Weidong Li 002; Jinwen Ou (Eur. J. Oper. Res., 2025)

Approximation algorithms for the integrated path and bin packing problem. - Weidong Li 002; Ruiqing Sun (RAIRO Oper. Res., 2025)

Multi-resource maximin share fair allocation in the cloud-edge collaborative computing system with bandwidth demand compression. - Hao Guo; Bin Deng; Weidong Li 002 (Clust. Comput., 2025)

An Alternative Mechanism for Multiresource Fair Allocation in Heterogeneous Cloud Computing Systems. - Bin Deng; Hao Guo; Weidong Li 002 (Concurr. Comput. Pract. Exp., 2025)

Truthful Mechanism for Resource Allocation and Pricing in Vehicle-Assisted Mobile Edge Computing. - Xi Liu 002; Jun Liu 081; Weidong Li 002 (IEEE Trans. Veh. Technol., 2025)

The budgeted maximin share allocation problem. - Bin Deng; Weidong Li 002 (Optim. Lett., 2025)

Approximate maximin share allocation for indivisible goods under a knapsack constraint. - Bin Deng; Weidong Li 002 (J. Comb. Optim., 2025)

An Optimal Reverse Affine Maximizer Auction Mechanism for Task Allocation in Mobile Crowdsensing. - Jixian Zhang; Peng Chen; Xuelin Yang; Hao Wu 010; Weidong Li 002 (IEEE Trans. Mob. Comput., 2025)

Dynamic Multiresource Fair Allocation With Time Discount Utility. - Bin Deng; Weidong Li 002 (IEEE Trans. Parallel Distributed Syst., 2025)