Two New Heuristics for the Equal Piles Problem. - Alok Singh 001; Ashok Kumar Gupta (IICAI, 2005)

A Hybrid Heuristic for the Minimum Weight Vertex Cover Problem. - Alok Singh 001; Ashok Kumar Gupta (Asia Pac. J. Oper. Res., 2006)

A hybrid heuristic for the maximum clique problem. - Alok Singh 001; Ashok Kumar Gupta (J. Heuristics, 2006)

A New Grouping Genetic Algorithm for the Quadratic Multiple Knapsack Problem. - Alok Singh 001; Anurag Singh Baghel (EvoCOP, 2007)

A Hybrid Evolutionary Approach to the Quadratic Knapsack Problem. - Alok Singh 001; Anurag Singh Baghel (IICAI, 2007)

Perturbation Based Local Search for the Degree-Constrained Minimum Spanning-Tree Problem. - Alok Singh 001; Ashok Kumar Gupta (IICAI, 2007)

Two heuristics for the one-dimensional bin-packing problem. - Alok Singh 001; Ashok Kumar Gupta (OR Spectr., 2007)

Improved heuristics for the bounded-diameter minimum spanning tree problem. - Alok Singh 001; Ashok Kumar Gupta (Soft Comput., 2007)

A New Heuristic for the Minimum Routing Cost Spanning Tree Problem. - Alok Singh 001 (ICIT, 2008)

New Metaheuristic Approaches for the Leaf-Constrained Minimum Spanning Tree Problem. - Alok Singh 001; Anurag Singh Baghel (Asia Pac. J. Oper. Res., 2008)

A Hybrid Grouping Genetic Algorithm for Multiprocessor Scheduling. - Alok Singh 001; Marc Sevaux; André Rossi (IC3, 2009)

An Artificial Bee Colony Algorithm for the Quadratic Knapsack Problem. - Srikanth Pulikanti; Alok Singh 001 (ICONIP (2), 2009)

An artificial bee colony algorithm for the leaf-constrained minimum spanning tree problem. - Alok Singh 001 (Appl. Soft Comput., 2009)

A new grouping genetic algorithm approach to the multiple traveling salesperson problem. - Alok Singh 001; Anurag Singh Baghel (Soft Comput., 2009)

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 Hybrid Permutation-Coded Evolutionary Algorithm for the Early/tardy Scheduling Problem. - Alok Singh 001 (Asia Pac. J. Oper. Res., 2010)

A metaheuristic for the fixed job scheduling problem under spread time constraints. - André Rossi; Alok Singh 001; Marc Sevaux (Comput. Oper. Res., 2010)

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

On the Cover Scheduling Problem in Wireless Sensor Networks. - André Rossi; Marc Sevaux; Alok Singh 001; Martin Josef Geiger (INOC, 2011)

Grouping Genetic Algorithm for Data Clustering. - Santhosh Peddi; Alok Singh 001 (SEMCCO (1), 2011)

Two Hybrid Meta-heuristic Approaches for Minimum Dominating Set Problem. - Anupama Potluri; Alok Singh 001 (SEMCCO (2), 2011)

Tabu Search for Multiprocessor Scheduling: Application to High Level Synthesis. - Marc Sevaux; Alok Singh 001; André Rossi (Asia Pac. J. Oper. Res., 2011)

A hybrid genetic algorithm for the minimum energy broadcast problem in wireless ad hoc networks. - Alok Singh 001; Wilson Naik Bhukya (Appl. Soft Comput., 2011)

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

Grenade Explosion Method for Maximum Weight Clique Problem. - Manohar Pallantla; Alok Singh 001 (IC3, 2012)

A Greedy Heuristic and Its Variants for Minimum Capacitated Dominating Set. - Anupama Potluri; Alok Singh 001 (IC3, 2012)

An exact approach for maximizing the lifetime of sensor networks with adjustable sensing ranges. - André Rossi; Alok Singh 001; Marc Sevaux (Comput. Oper. Res., 2012)

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

Hybrid heuristics for the single machine scheduling problem with quadratic earliness and tardiness costs. - Alok Singh 001; Jorge M. S. Valente; Maria do Rosário Alves Moreira (Int. J. Mach. Learn. Cybern., 2012)

Column generation algorithm for sensor coverage scheduling under bandwidth constraints. - André Rossi; Alok Singh 001; Marc Sevaux (Networks, 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 study on energy issues in construction of all-to-all minimum power broadcast (A2A MPB) trees in wireless networks. - Wilson Naik Bhukya; Alok Singh 001 (ICACCI, 2013)

An Ant Colony Optimization Algorithm for the Min-Degree Constrained Minimum Spanning Tree Problem. - V. Venkata Ramana Murthy; Alok Singh 001 (SEMCCO (2), 2013)

Metaheuristic Approaches for Multiprocessor Scheduling. - Lakshmi Kanth Munganda; Alok Singh 001 (SocProS (1), 2013)

A genetic algorithm based exact approach for lifetime maximization of directional sensor networks. - Alok Singh 001; André Rossi (Ad Hoc Networks, 2013)

Hybrid metaheuristic algorithms for minimum weight dominating set. - Anupama Potluri; Alok Singh 001 (Appl. Soft Comput., 2013)

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

Lifetime maximization in wireless directional sensor network. - André Rossi; Alok Singh 001; Marc Sevaux (Eur. J. Oper. Res., 2013)

Metaheuristic algorithms for computing capacitated dominating set with uniform and variable capacities. - Anupama Potluri; Alok Singh 001 (Swarm Evol. Comput., 2013)

An effective heuristic for construction of all-to-all minimum power broadcast trees in wireless networks. - Wilson Naik Bhukya; Alok Singh 001 (ICACCI, 2014)

A Novel ELM K-Means Algorithm for Clustering. - Abobakr Khalil Alshamiri; Bapi Raju Surampudi; Alok Singh 001 (SEMCCO, 2014)

A Hybrid Artificial Bee Colony Algorithm for the Terminal Assignment Problem. - Jayalakshmi Banda; Alok Singh 001 (SEMCCO, 2014)

An artificial bee colony algorithm for minimum weight dominating set. - C. G. Nitash; Alok Singh 001 (SIS, 2014)

A hybrid evolutionary approach to the registration area planning problem. - Sachchida Nand Chaurasia; Alok Singh 001 (Appl. Intell., 2014)

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

A hybrid evolutionary algorithm with guided mutation for minimum weight dominating set. - Sachchida Nand Chaurasia; Alok Singh 001 (Appl. Intell., 2015)

Two metaheuristic approaches for the multiple traveling salesperson problem. - Pandiri Venkatesh; Alok Singh 001 (Appl. Soft Comput., 2015)

Swarm intelligence approaches for cover scheduling problem in wireless sensor networks. - Vuyyuru Gopinadh; Alok Singh 001 (Int. J. Bio Inspired Comput., 2015)

A hybrid swarm intelligence approach to the registration area planning problem. - Sachchida Nand Chaurasia; Alok Singh 001 (Inf. Sci., 2015)

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

Comparative analysis of ELM and No-Prop algorithms. - Abobakr Khalil Alshamiri; Alok Singh 001; Bapi Raju Surampudi (IC3, 2016)

Swarm intelligence approaches for multidepot salesmen problems with load balancing. - Venkatesh Pandiri; Alok Singh 001 (Appl. Intell., 2016)

A swarm intelligence approach for the p-median problem. - Jayalakshmi Banda; Alok Singh 001 (Int. J. Metaheuristics, 2016)

Artificial bee colony algorithm for clustering: an extreme learning approach. - Abobakr Khalil Alshamiri; Alok Singh 001; Bapi Raju Surampudi (Soft Comput., 2016)

A hybrid heuristic for dominating tree problem. - Sachchida Nand Chaurasia; Alok Singh 001 (Soft Comput., 2016)

Hybrid artificial bee colony algorithm based approaches for two ring loading problems. - Alok Singh 001; Jayalakshmi Banda (Appl. Intell., 2017)

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

Hybrid evolutionary approaches for the single machine order acceptance and scheduling problem. - Sachchida Nand Chaurasia; Alok Singh 001 (Appl. Soft Comput., 2017)

Heuristics for lifetime maximization in camera sensor networks. - Alok Singh 001; André Rossi; Marc Sevaux (Inf. Sci., 2017)

A hybrid artificial bee colony algorithm for the cooperative maximum covering location problem. - Jayalakshmi Banda; Alok Singh 001 (Int. J. Mach. Learn. Cybern., 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)

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

A swarm intelligence approach for the colored traveling salesman problem. - Venkatesh Pandiri; Alok Singh 001 (Appl. Intell., 2018)

Boosting an evolution strategy with a preprocessing step: application to group scheduling problem in directional sensor networks. - Gaurav Srivastava 002; Alok Singh 001 (Appl. Intell., 2018)

A hyper-heuristic based artificial bee colony algorithm for k-Interconnected multi-depot multi-traveling salesman problem. - Venkatesh Pandiri; Alok Singh 001 (Inf. Sci., 2018)

Two swarm intelligence approaches for tuning extreme learning machine. - Abobakr Khalil Alshamiri; Alok Singh 001; Bapi Raju Surampudi (Int. J. Mach. Learn. Cybern., 2018)

A Multi-Start Iterated Local Search Algorithm for the Maximum Scatter Traveling Salesman Problem. - Pandiri Venkatesh; Alok Singh 001; Rammohan Mallipeddi (CEC, 2019)

An Evolutionary Approach to Multi-point Relays Selection in Mobile Ad Hoc Networks. - Alok Singh 001; Wilson Naik Bhukya (PReMI (1), 2019)

An artificial bee colony algorithm with variable degree of perturbation for the generalized covering traveling salesman problem. - Venkatesh Pandiri; Alok Singh 001 (Appl. Soft Comput., 2019)

An evolution strategy based approach for cover scheduling problem in wireless sensor networks. - Gaurav Srivastava 002; Pandiri Venkatesh; Alok Singh 001 (Int. J. Mach. Learn. Cybern., 2020)

Two hybrid metaheuristic approaches for the covering salesman problem. - Venkatesh Pandiri; Alok Singh 001; André Rossi (Neural Comput. Appl., 2020)

A Hybrid Discrete Differential Evolution Approach for the Single Machine Total Stepwise Tardiness Problem with Release Dates. - Gaurav Srivastava 002; Alok Singh 001; Rammohan Mallipeddi (CEC, 2021)

Multi-start iterated local search, exact and matheuristic approaches for minimum capacitated dominating set problem. - Mallikarjun Rao Nakkala; Alok Singh 001; André Rossi (Appl. Soft Comput., 2021)

NSGA-II with objective-specific variation operators for multiobjective vehicle routing problem with time windows. - Gaurav Srivastava 002; Alok Singh 001; Rammohan Mallipeddi (Expert Syst. Appl., 2021)

A simple hyper-heuristic approach for a variant of many-to-many hub location-routing problem. - Venkatesh Pandiri; Alok Singh 001 (J. Heuristics, 2021)

Focus distance-aware lifetime maximization of video camera-based wireless sensor networks. - André Rossi; Alok Singh 001; Marc Sevaux (J. Heuristics, 2021)

Multi-start heuristics for the profitable tour problem. - Kasi Viswanath Dasari; Venkatesh Pandiri; Alok Singh 001 (Swarm Evol. Comput., 2021)

An evolutionary approach for obnoxious cooperative maximum covering location problem. - Edukondalu Chappidi; Alok Singh 001 (Appl. Intell., 2022)

Swarm intelligence, exact and matheuristic approaches for minimum weight directed dominating set problem. - Mallikarjun Rao Nakkala; Alok Singh 001; André Rossi (Eng. Appl. Artif. Intell., 2022)

Intelligent Optimization Algorithms for Disruptive Anti-covering Location Problem. - Edukondalu Chappidi; Alok Singh 001; Rammohan Mallipeddi (ICDCIT, 2023)

Heuristics for K-Independent Average Traveling Salesperson Problem. - Sebanti Majumder; Alok Singh 001 (MIWAI, 2023)

An evolutionary approach comprising tailor-made variation operators for rescue unit allocation and scheduling with fuzzy processing times. - Gaurav Srivastava 002; Alok Singh 001 (Eng. Appl. Artif. Intell., 2023)

Two evolutionary approaches with objective-specific variation operators for vehicle routing problem with time windows and quality of service objectives. - Gaurav Srivastava 002; Alok Singh 001 (Appl. Soft Comput., 2023)

Evolutionary approaches for the weighted anti-covering location problem. - Edukondalu Chappidi; Alok Singh 001 (Evol. Intell., 2023)

Two heuristic approaches for clustered traveling salesman problem with d-relaxed priority rule. - Kasi Viswanath Dasari; Alok Singh 001 (Expert Syst. Appl., 2023)

A hyper-heuristic based approach with naive Bayes classifier for the reliability p-median problem. - Edukondalu Chappidi; Alok Singh 001 (Appl. Intell., 2023)

A General Variable Neighborhood Search Approach for the Clustered Traveling Salesman Problem with d-Relaxed Priority Rule. - Kasi Viswanath Dasari; Alok Singh 001; Rammohan Mallipeddi (ICDCIT, 2024)

Solution of maximum scatter traveling salesman problem through evolutionary approaches. - Alok Singh 001; Sebanti Majumder (Appl. Soft Comput., 2024)

Solution of the family traveling salesman problem using a hyper-heuristic approach. - Venkatesh Pandiri; Alok Singh 001 (Eng. Appl. Artif. Intell., 2024)

An evolution strategy with tailor-made mutation operator for colored balanced traveling salesman problem. - Sebanti Majumder; Alok Singh 001 (Appl. Intell., 2024)

A diversity preserving genetic algorithm with tailor-made variation operators for the quadratic bottleneck knapsack problem. - Pritibahen Sumanbhai Patel; Alok Singh 001 (Evol. Intell., 2024)

Solution of minimum general partial dominating set problem through heuristic approaches. - Mohd Danish Rasheed; Alok Singh 001 (Comput. Electr. Eng., 2025)

A swarm intelligence approach to minimum weight independent dominating set problem. - Mohd Danish Rasheed; Alok Singh 001; Rammohan Mallipeddi (Comput. Electr. Eng., 2025)

Solution of reliable p-median problem with at-facility service using multi-start hyper-heuristic approaches. - Edukondalu Chappidi; Alok Singh 001 (Appl. Intell., 2025)

Minimum-cardinality global defensive alliances in general graphs. - André Rossi; Alok Singh 001 (Ann. Oper. Res., 2025)