An Artificial Bee Colony Algorithm for the 0-1 Multidimensional Knapsack Problem. - Shyam Sundar 001; Alok Singh 001; André Rossi (IC3 (1), 2010)

A Swarm Intelligence Approach to the Quadratic Multiple Knapsack Problem. - Shyam Sundar 001; Alok Singh 001 (ICONIP (1), 2010)

A swarm intelligence approach to the quadratic minimum spanning tree problem. - Shyam Sundar 001; Alok Singh 001 (Inf. Sci., 2010)

An artificial bee colony algorithm for the minimum routing cost spanning tree problem. - Alok Singh 001; Shyam Sundar 001 (Soft Comput., 2011)

New heuristics for two bounded-degree spanning tree problems. - Shyam Sundar 001; Alok Singh 001; André Rossi (Inf. Sci., 2012)

A hybrid heuristic for the set covering problem. - Shyam Sundar 001; Alok Singh 001 (Oper. Res., 2012)

A swarm intelligence approach to the early/tardy scheduling problem. - Shyam Sundar 001; Alok Singh 001 (Swarm Evol. Comput., 2012)

A Swarm Intelligence Approach to Flexible Job-Shop Scheduling Problem with No-Wait Constraint in Remanufacturing. - Shyam Sundar 001; Ponnuthurai N. Suganthan; Tay Jin Chua (ICAISC (2), 2013)

New heuristic approaches for the dominating tree problem. - Shyam Sundar 001; Alok Singh 001 (Appl. Soft Comput., 2013)

A Steady-State Genetic Algorithm for the Dominating Tree Problem. - Shyam Sundar 001 (SEAL, 2014)

An Ant Colony Optimization Approach for the Dominating Tree Problem. - Shyam Sundar 001; Sachchida Nand Chaurasia; Alok Singh 001 (SEMCCO, 2015)

An Interactive Mobile Application for the Visually Impaired to Have Access to Listening Audio Books with Handy Books Portal. - Avanthika Meenakshi; Shyam Sundar 001; Silviya Nancy (Int. J. Interact. Mob. Technol., 2015)

Metaheuristic Approaches for the Blockmodel Problem. - Shyam Sundar 001; Alok Singh 001 (IEEE Syst. J., 2015)

Ant Colony Optimization Approaches for the Tree t-Spanner Problem. - Manisha Israni; Shyam Sundar 001 (IJCCI, 2017)

Two grouping-based metaheuristics for clique partitioning problem. - Shyam Sundar 001; Alok Singh 001 (Appl. Intell., 2017)

Hybrid metaheuristic approaches for the single machine total stepwise tardiness problem with release dates. - Sachchida Nand Chaurasia; Shyam Sundar 001; Alok Singh 001 (Oper. Res., 2017)

A hybrid artificial bee colony algorithm for the job-shop scheduling problem with no-wait constraint. - Shyam Sundar 001; Ponnuthurai N. Suganthan; Tay Jin Chua; Tian Xiang Cai; Chong Chin Soon (Soft Comput., 2017)

Properties and Exact Solution Approaches for the Minimum Cost Dominating Tree Problem. - André Rossi; Alok Singh 001; Shyam Sundar 001 (ICDCIT, 2018)

Two new heuristics for the dominating tree problem. - Kavita Singh; Shyam Sundar 001 (Appl. Intell., 2018)

Artifical bee colony algorithm using problem-specific neighborhood strategies for the tree t-spanner problem. - Kavita Singh; Shyam Sundar 001 (Appl. Soft Comput., 2018)

A Hybrid Ant Colony Optimization Approach for the Cyclic Antibandwidth Problem. - Shyam Sundar 001 (CoDIT, 2019)

A hybrid steady-state genetic algorithm for the min-degree constrained minimum spanning tree problem. - Kavita Singh; Shyam Sundar 001 (Eur. J. Oper. Res., 2019)

A new hybrid genetic algorithm for the maximally diverse grouping problem. - Kavita Singh; Shyam Sundar 001 (Int. J. Mach. Learn. Cybern., 2019)

Two heuristics for the rainbow spanning forest problem. - Sudishna Ghoshal; Shyam Sundar 001 (Eur. J. Oper. Res., 2020)

A hybrid genetic algorithm for the degree-constrained minimum spanning tree problem. - Kavita Singh; Shyam Sundar 001 (Soft Comput., 2020)

Two approaches for the min-degree constrained minimum spanning tree problem. - Sudishna Ghoshal; Shyam Sundar 001 (Appl. Soft Comput., 2021)

Artificial bee colony algorithm using permutation encoding for the bounded diameter minimum spanning tree problem. - Kavita Singh; Shyam Sundar 001 (Soft Comput., 2021)

A Hybrid Steady-State Genetic Algorithm for the Minimum Conflict Spanning Tree Problem. - Punit Kumar Chaubey; Shyam Sundar 001 (LOD (2), 2023)

Two phases of metaheuristic techniques for the minimum conflict weighted spanning tree problem. - Punit Kumar Chaubey; Shyam Sundar 001 (Appl. Soft Comput., 2023)

A Steady-State Grouping Genetic Algorithm for the Rainbow Spanning Forest Problem. - Sudishna Ghoshal; Shyam Sundar 001 (SN Comput. Sci., 2023)

A Steady-State Genetic Algorithm for the Single Machine Scheduling Problem with Periodic Machine Availability. - Punit Kumar Chaubey; Shyam Sundar 001 (SN Comput. Sci., 2023)

An Iterated Local Search for the Minimum Edge-Dilation K-Center Problem. - Manisha Israni; Shyam Sundar 001 (SN Comput. Sci., 2023)

An artificial bee colony algorithm for the minimum edge-dilation K-center problem. - Manisha Israni; Shyam Sundar 001 (Soft Comput., 2024)

An Iterative Local Search for the Single Machine Scheduling Problem with Periodic Machine Availability. - Manisha Israni; Shyam Sundar 001 (SN Comput. Sci., 2025)