Jianping Li
Orcid: 0000-0003-1508-1440Affiliations:
- Yunnan University, Kunming, China
According to our database1,
Jianping Li
authored at least 57 papers
between 1996 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
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
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
Theor. Comput. Sci., 2023
J. Comb. Optim., 2023
Proceedings of the Computing and Combinatorics - 29th International Conference, 2023
Proceedings of the Combinatorial Optimization and Applications, 2023
2022
Approximation algorithms for solving the line-capacitated minimum Steiner tree problem.
J. Glob. Optim., 2022
Approximation algorithms for constructing required subgraphs using stock pieces of fixed length.
J. Comb. 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
On the minimum number of Steiner points of constrained 1-line-fixed Steiner tree in the Euclidean plane ${\mathbb {R}}^2$.
Optim. Lett., 2021
Proceedings of the Algorithmic Aspects in Information and Management, 2021
2020
Approximation algorithms for solving the 1-line Euclidean minimum Steiner tree problem.
J. Comb. Optim., 2020
On Approximations for Constructing 1-Line Minimum Rectilinear Steiner Trees in the Euclidean Plane ℝ<sup>2</sup>.
Proceedings of the Algorithmic Aspects in Information and Management, 2020
2019
Improved approximation algorithms for the combination problem of parallel machine scheduling and path.
J. Comb. Optim., 2019
On Approximations for Constructing Required Subgraphs Using Stock Pieces of Fixed Length.
Proceedings of the Algorithmic Aspects in Information and Management, 2019
2018
Approximation algorithms for constructing specific subgraphs with minimum number of length-bounded stock pieces.
Inf. Process. Lett., 2018
Proceedings of the 2018 2nd International Conference on Computer Science and Artificial Intelligence, 2018
2017
Approximation algorithms for constructing spanning K-trees using stock pieces of bounded length.
Optim. Lett., 2017
Proceedings of the Combinatorial Optimization and Applications, 2017
Proceedings of the 16th IEEE/ACIS International Conference on Computer and Information Science, 2017
2016
RAIRO Oper. Res., 2016
Approximations for constructing tree-form structures using specific material with fixed length.
Optim. Lett., 2016
2015
Theor. Comput. Sci., 2015
Proceedings of the WALCOM: Algorithms and Computation - 9th International Workshop, 2015
2014
Approximation algorithms for $k$ -partitioning problems with partition matroid constraint.
Optim. Lett., 2014
Inf. Process. Lett., 2014
Eur. J. Oper. Res., 2014
Approximation algorithms for solving the constrained arc routing problem in mixed graphs.
Eur. J. Oper. Res., 2014
Parallel-Machine Scheduling Problem under the Job Rejection Constraint - (Extended Abstract).
Proceedings of the Frontiers in Algorithmics - 8th International Workshop, 2014
2013
Approximations for two variants of the Steiner tree problem in the Euclidean plane $${\mathbb{R}^2}$$.
J. Glob. Optim., 2013
Inf. Process. Lett., 2013
2012
A polynomial time approximation scheme for embedding a directed hypergraph on a weighted ring.
J. Comb. Optim., 2012
Two Approximation Schemes for Scheduling on Parallel Machines under a grade of Service Provision.
Asia Pac. J. Oper. Res., 2012
2010
2009
An improved approximation algorithm for the ATSP with parameterized triangle inequality.
J. Algorithms, 2009
Polynomial Approximation Schemes for the Max-Min Allocation Problem under a grade of Service Provision.
Discret. Math. Algorithms Appl., 2009
2008
2007
Some approximation algorithms for the clique partition problem in weighted interval graphs.
Theor. Comput. Sci., 2007
2006
Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006
2005
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005
2003
Channel Assignment in Wireless Mobile Networks with Frequency Interference Over Distance.
Proceedings of the International Conference on Communications in Computing, 2003
2001
Cycles Containing Given Subsets in 1-Tough Graphs.
Ars Comb., 2001
Proceedings of the Computational Science - ICCS 2001, 2001
1997
1996
A proof of a conjecture about D<sub>lambda</sub>-paths in graphs with large neighborhood unions.
Discret. Math., 1996