Shyam Sundar

Orcid: 0000-0001-9679-0892

Affiliations:
  • National Institute of Technology Raipur, India


According to our database1, Shyam Sundar authored at least 32 papers between 2010 and 2023.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
An Iterated Local Search for the Minimum Edge-Dilation K-Center Problem.
SN Comput. Sci., November, 2023

A Steady-State Genetic Algorithm for the Single Machine Scheduling Problem with Periodic Machine Availability.
SN Comput. Sci., September, 2023

A Steady-State Grouping Genetic Algorithm for the Rainbow Spanning Forest Problem.
SN Comput. Sci., July, 2023

Two phases of metaheuristic techniques for the minimum conflict weighted spanning tree problem.
Appl. Soft Comput., May, 2023

A Hybrid Steady-State Genetic Algorithm for the Minimum Conflict Spanning Tree Problem.
Proceedings of the Machine Learning, Optimization, and Data Science, 2023

2021
Artificial bee colony algorithm using permutation encoding for the bounded diameter minimum spanning tree problem.
Soft Comput., 2021

Two approaches for the min-degree constrained minimum spanning tree problem.
Appl. Soft Comput., 2021

2020
A hybrid genetic algorithm for the degree-constrained minimum spanning tree problem.
Soft Comput., 2020

Two heuristics for the rainbow spanning forest problem.
Eur. J. Oper. Res., 2020

2019
A new hybrid genetic algorithm for the maximally diverse grouping problem.
Int. J. Mach. Learn. Cybern., 2019

A hybrid steady-state genetic algorithm for the min-degree constrained minimum spanning tree problem.
Eur. J. Oper. Res., 2019

A Hybrid Ant Colony Optimization Approach for the Cyclic Antibandwidth Problem.
Proceedings of the 6th International Conference on Control, 2019

2018
Artifical bee colony algorithm using problem-specific neighborhood strategies for the tree t-spanner problem.
Appl. Soft Comput., 2018

Two new heuristics for the dominating tree problem.
Appl. Intell., 2018

Properties and Exact Solution Approaches for the Minimum Cost Dominating Tree Problem.
Proceedings of the Distributed Computing and Internet Technology, 2018

2017
A hybrid artificial bee colony algorithm for the job-shop scheduling problem with no-wait constraint.
Soft Comput., 2017

Hybrid metaheuristic approaches for the single machine total stepwise tardiness problem with release dates.
Oper. Res., 2017

Two grouping-based metaheuristics for clique partitioning problem.
Appl. Intell., 2017

Ant Colony Optimization Approaches for the Tree t-Spanner Problem.
Proceedings of the 9th International Joint Conference on Computational Intelligence, 2017

2015
Metaheuristic Approaches for the Blockmodel Problem.
IEEE Syst. J., 2015

An Interactive Mobile Application for the Visually Impaired to Have Access to Listening Audio Books with Handy Books Portal.
Int. J. Interact. Mob. Technol., 2015

An Ant Colony Optimization Approach for the Dominating Tree Problem.
Proceedings of the Swarm, Evolutionary, and Memetic Computing, 2015

2014
A Steady-State Genetic Algorithm for the Dominating Tree Problem.
Proceedings of the Simulated Evolution and Learning - 10th International Conference, 2014

2013
New heuristic approaches for the dominating tree problem.
Appl. Soft Comput., 2013

A Swarm Intelligence Approach to Flexible Job-Shop Scheduling Problem with No-Wait Constraint in Remanufacturing.
Proceedings of the Artificial Intelligence and Soft Computing, 2013

2012
A swarm intelligence approach to the early/tardy scheduling problem.
Swarm Evol. Comput., 2012

A hybrid heuristic for the set covering problem.
Oper. Res., 2012

New heuristics for two bounded-degree spanning tree problems.
Inf. Sci., 2012

2011
An artificial bee colony algorithm for the minimum routing cost spanning tree problem.
Soft Comput., 2011

2010
A swarm intelligence approach to the quadratic minimum spanning tree problem.
Inf. Sci., 2010

A Swarm Intelligence Approach to the Quadratic Multiple Knapsack Problem.
Proceedings of the Neural Information Processing. Theory and Algorithms, 2010

An Artificial Bee Colony Algorithm for the 0-1 Multidimensional Knapsack Problem.
Proceedings of the Contemporary Computing - Third International Conference, 2010


  Loading...