Pengxiang Pan

Orcid: 0000-0001-5713-0867

According to our database1, Pengxiang Pan authored at least 15 papers between 2021 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Approximation algorithms for solving the vertex-traversing-constrained mixed Chinese postman problem.
J. Glob. Optim., December, 2024

Approximation algorithms for solving the trip-constrained vehicle routing cover problems.
J. Comb. Optim., October, 2024

The prize-collecting single machine scheduling with bounds and penalties.
J. Comb. Optim., September, 2024

Approximation algorithms for the restricted k-Chinese postman problems with penalties.
Optim. Lett., January, 2024

Algorithms for the Constrained Assignment Problems with Bounds and Maximum Penalty.
Proceedings of the Algorithmic Aspects in Information and Management, 2024

2023
Combinatorial algorithms for solving the constrained knapsack problems with divisible item sizes and penalties.
Optim. Lett., November, 2023

Exact algorithms for solving the constrained parallel-machine scheduling problems with divisible processing times and penalties.
J. Comb. Optim., April, 2023

Delay-constrained minimum shortest path trees and related problems.
Theor. Comput. Sci., 2023

Approximation algorithms for solving the heterogeneous Chinese postman problem.
J. Comb. Optim., 2023

The Heterogeneous Rooted Tree Cover Problem.
Proceedings of the Computing and Combinatorics - 29th International Conference, 2023

2022
Bin packing with divisible item sizes and rejection penalties.
Optim. Lett., 2022

Approximation algorithms for solving the line-capacitated minimum Steiner tree problem.
J. Glob. Optim., 2022

The Constrained Parallel-Machine Scheduling Problem with Divisible Processing Times and Penalties.
Proceedings of the Algorithmic Aspects in Information and Management, 2022

2021
The restricted Chinese postman problems with penalties.
Oper. Res. Lett., 2021

An Approximation Algorithm for Solving the Heterogeneous Chinese Postman Problem.
Proceedings of the Algorithmic Aspects in Information and Management, 2021


  Loading...