Follow
Dr. Jayanth Kumar Thenepalle
Dr. Jayanth Kumar Thenepalle
Verified email at jainuniversity.ac.in
Title
Cited by
Cited by
Year
An open close multiple travelling salesman problem with single depot
J Thenepalle, P Singamsetty
Decision Science Letters 8 (2), 121-136, 2019
102019
An efficient genetic algorithm for solving open multiple travelling salesman problem with load balancing constraint
P Singamsetty, J Thenepalle
Decision Science Letters 10 (4), 525-534, 2021
92021
Designing optimal route for the distribution chain of a rural LPG delivery system
P Singamsetty, J Thenepalle
International journal of industrial engineering computations 12 (2), 221-234, 2021
82021
The degree constrained k-cardinality minimum spanning tree problem: a lexi-search algorithm
T Kumar, S Purusotham
Decision Science Letters 7 (3), 301-310, 2018
52018
An ordered precedence constrained flow shop scheduling problem with machine specific preventive maintenance
T Kumar, M Thangaraj
Journal of Project Management 8 (1), 45-56, 2023
42023
A precedence constrained flow shop scheduling problem with transportation time, breakdown times, and weighted jobs
K Thangaraj, M., Kumar, T., & Nandan
Journal of Project Management 7 (4), 229-240, 2022
42022
An exact algorithm for constrained k-cardinality unbalanced assignment problem
A Prakash, U Balakrishna, J Thenepalle
International Journal of Industrial Engineering Computations 13 (2), 267-276, 2022
42022
Bi-criteria travelling salesman subtour problem with time threshold
J Kumar Thenepalle, P Singamsetty
The European Physical Journal Plus 133, 1-15, 2018
42018
An efficient hybrid genetic algorithm for solving truncated travelling salesman problem
S Purusotham, T Jayanth, T Vimala, K Ghanshyam
Decision Science Letters 11 (4), 473-484, 2022
32022
Lexi-search algorithm for one to many multidimensional bi-criteria unbalanced assignment problem
JK Thenepalle, P Singamsetty
International Journal of Bio-Inspired Computation 14 (3), 151-170, 2019
32019
An exact algorithm for k-cardinality degree constrained clustered minimum spanning tree problem
TJ Kumar, S Purusotham
IOP Conference Series: Materials Science and Engineering 263 (4), 042112, 2017
32017
Solving open travelling salesman subset-tour problem through a hybrid genetic algorithm
P Singamsetty, J Thenepalle, B Uruturu
Journal of Project Management 6 (4), 209-222, 2021
22021
An articulation point-based approximation algorithm for minimum vertex cover problem
JK Thenepalle, P Singamsetty
Advances in Algebra and Analysis: International Conference on Advances in …, 2018
22018
An exact algorithm for multi-constrained minimum spanning tree problem
TJ Kumar, P Singamsetty
International Journal of Mathematics in Operational Research 12 (3), 317-330, 2018
22018
A Three-Machine n-Job Flow Shop Scheduling Problem with Setup and Machine-Specific Halting Times
TJ Kumar, M Thangaraj, KJ Ghanashyam, T Vimala
The International Conference on Recent Innovations in Computing, 3-14, 2022
12022
Solving the single depot open close multiple travelling salesman problem through a multi-chromosome based genetic algorithm
M Veeresh, T Kumar, M Thangaraj
Decision Science Letters 13 (2), 401-414, 2024
2024
An Effective CDS Algorithm for an Ordered Precedence Constrained Flow Shop Scheduling Problem for n-jobs and m-machines
A Rao, M Thangaraj, TJ Kumar
2023 International Conference on Computer Science and Emerging Technologies …, 2023
2023
Solving an Open k-city Travelling Salesman Problem with Ordered Constraint: An Exact Lexi-search Algorithm
S Mastan, U Balakrishna, G Raju, TJ Kumar
Turkish Online Journal of Qualitative Inquiry, 2021
2021
An Articulation Point Based Heuristic Algorithm for Minimum Weight Vertex Cover Problem
S Mastan, U Balakrishna, G Raju, TJ Kumar
GIS Science Journal 8 (1), 2021
2021
An enumerative exact algorithm for clustered minimum spanning tree problem with degree constraint
JKT Purusotham S
Global Journal of Pure and Applied Mathematics 12 (3), 11-15, 2016
2016
The system can't perform the operation now. Try again later.
Articles 1–20