default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlok Singh 0001
Person information
- affiliation: University of Hyderabad, School of Computer and Information Sciences, India
- affiliation (PhD 2006): University of Allahabad, India
Other persons with the same name
- Alok Singh — disambiguation page
- Alok Singh 0002 — Motilal Nehru National Institute of Technology, Allahabad, India
- Alok Singh 0003 — Verayo, Inc., San Jose, CA, USA
- Alok Singh 0004 — University of California, San Diego Supercomputer Center, La Jolla, CA, USA
- Alok Singh 0005 — National Institute of Technology Goa, Department of Computer Science and Engineering, Ponda, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j63]Sebanti Majumder
, Alok Singh:
An evolution strategy with tailor-made mutation operator for colored balanced traveling salesman problem. Appl. Intell. 54(8): 6125-6137 (2024)- [j62]Alok Singh, Sebanti Majumder:
Solution of maximum scatter traveling salesman problem through evolutionary approaches. Appl. Soft Comput. 163: 111858 (2024) - [j61]Venkatesh Pandiri, Alok Singh:
Solution of the family traveling salesman problem using a hyper-heuristic approach. Eng. Appl. Artif. Intell. 133: 108193 (2024) - [j60]Pritibahen Sumanbhai Patel, Alok Singh:
A diversity preserving genetic algorithm with tailor-made variation operators for the quadratic bottleneck knapsack problem. Evol. Intell. 17(3): 1953-1965 (2024) - [c30]Kasi Viswanath Dasari, Alok Singh, Rammohan Mallipeddi:
A General Variable Neighborhood Search Approach for the Clustered Traveling Salesman Problem with d-Relaxed Priority Rule. ICDCIT 2024: 356-370 - 2023
- [j59]Edukondalu Chappidi, Alok Singh:
A hyper-heuristic based approach with naive Bayes classifier for the reliability p-median problem. Appl. Intell. 53(22): 27269-27289 (2023) - [j58]Gaurav Srivastava, Alok Singh:
Two evolutionary approaches with objective-specific variation operators for vehicle routing problem with time windows and quality of service objectives. Appl. Soft Comput. 134: 109964 (2023) - [j57]Gaurav Srivastava, Alok Singh:
An evolutionary approach comprising tailor-made variation operators for rescue unit allocation and scheduling with fuzzy processing times. Eng. Appl. Artif. Intell. 123(Part A): 106246 (2023) - [j56]Kasi Viswanath Dasari, Alok Singh:
Two heuristic approaches for clustered traveling salesman problem with d-relaxed priority rule. Expert Syst. Appl. 224: 120003 (2023) - [j55]Edukondalu Chappidi, Alok Singh:
Evolutionary approaches for the weighted anti-covering location problem. Evol. Intell. 16(3): 891-901 (2023) - [c29]Edukondalu Chappidi, Alok Singh, Rammohan Mallipeddi:
Intelligent Optimization Algorithms for Disruptive Anti-covering Location Problem. ICDCIT 2023: 165-180 - [c28]Sebanti Majumder, Alok Singh:
Heuristics for K-Independent Average Traveling Salesperson Problem. MIWAI 2023: 25-35 - 2022
- [j54]Edukondalu Chappidi, Alok Singh:
An evolutionary approach for obnoxious cooperative maximum covering location problem. Appl. Intell. 52(14): 16651-16666 (2022) - [j53]Mallikarjun Rao Nakkala, Alok Singh, André Rossi:
Swarm intelligence, exact and matheuristic approaches for minimum weight directed dominating set problem. Eng. Appl. Artif. Intell. 109: 104647 (2022) - 2021
- [j52]Mallikarjun Rao Nakkala, Alok Singh, André Rossi:
Multi-start iterated local search, exact and matheuristic approaches for minimum capacitated dominating set problem. Appl. Soft Comput. 108: 107437 (2021) - [j51]Gaurav Srivastava, Alok Singh, Rammohan Mallipeddi:
NSGA-II with objective-specific variation operators for multiobjective vehicle routing problem with time windows. Expert Syst. Appl. 176: 114779 (2021) - [j50]André Rossi, Alok Singh, Marc Sevaux:
Focus distance-aware lifetime maximization of video camera-based wireless sensor networks. J. Heuristics 27(1-2): 5-30 (2021) - [j49]Venkatesh Pandiri, Alok Singh:
A simple hyper-heuristic approach for a variant of many-to-many hub location-routing problem. J. Heuristics 27(5): 791-868 (2021) - [j48]Kasi Viswanath Dasari, Venkatesh Pandiri, Alok Singh:
Multi-start heuristics for the profitable tour problem. Swarm Evol. Comput. 64: 100897 (2021) - [c27]Gaurav Srivastava, Alok Singh, Rammohan Mallipeddi:
A Hybrid Discrete Differential Evolution Approach for the Single Machine Total Stepwise Tardiness Problem with Release Dates. CEC 2021: 652-659 - 2020
- [j47]Gaurav Srivastava, Pandiri Venkatesh, Alok Singh:
An evolution strategy based approach for cover scheduling problem in wireless sensor networks. Int. J. Mach. Learn. Cybern. 11(9): 1981-2006 (2020) - [j46]Venkatesh Pandiri, Alok Singh, André Rossi:
Two hybrid metaheuristic approaches for the covering salesman problem. Neural Comput. Appl. 32(19): 15643-15663 (2020)
2010 – 2019
- 2019
- [j45]Venkatesh Pandiri, Alok Singh:
An artificial bee colony algorithm with variable degree of perturbation for the generalized covering traveling salesman problem. Appl. Soft Comput. 78: 481-495 (2019) - [c26]Pandiri Venkatesh, Alok Singh, Rammohan Mallipeddi:
A Multi-Start Iterated Local Search Algorithm for the Maximum Scatter Traveling Salesman Problem. CEC 2019: 1390-1397 - [c25]Alok Singh, Wilson Naik Bhukya:
An Evolutionary Approach to Multi-point Relays Selection in Mobile Ad Hoc Networks. PReMI (1) 2019: 375-384 - 2018
- [j44]Venkatesh Pandiri, Alok Singh:
A swarm intelligence approach for the colored traveling salesman problem. Appl. Intell. 48(11): 4412-4428 (2018) - [j43]Gaurav Srivastava, Alok Singh:
Boosting an evolution strategy with a preprocessing step: application to group scheduling problem in directional sensor networks. Appl. Intell. 48(12): 4760-4774 (2018) - [j42]Venkatesh Pandiri, Alok Singh:
A hyper-heuristic based artificial bee colony algorithm for k-Interconnected multi-depot multi-traveling salesman problem. Inf. Sci. 463-464: 261-281 (2018) - [j41]Abobakr Khalil Alshamiri, Alok Singh, Bapi Raju Surampudi:
Two swarm intelligence approaches for tuning extreme learning machine. Int. J. Mach. Learn. Cybern. 9(8): 1271-1283 (2018) - [c24]André Rossi, Alok Singh, Shyam Sundar:
Properties and Exact Solution Approaches for the Minimum Cost Dominating Tree Problem. ICDCIT 2018: 3-26 - 2017
- [j40]Shyam Sundar, Alok Singh:
Two grouping-based metaheuristics for clique partitioning problem. Appl. Intell. 47(2): 430-442 (2017) - [j39]Alok Singh, Jayalakshmi Banda:
Hybrid artificial bee colony algorithm based approaches for two ring loading problems. Appl. Intell. 47(4): 1157-1168 (2017) - [j38]Sachchida Nand Chaurasia, Alok Singh:
Hybrid evolutionary approaches for the single machine order acceptance and scheduling problem. Appl. Soft Comput. 52: 725-747 (2017) - [j37]Alok Singh, André Rossi, Marc Sevaux:
Heuristics for lifetime maximization in camera sensor networks. Inf. Sci. 385: 475-491 (2017) - [j36]Jayalakshmi Banda, Alok Singh:
A hybrid artificial bee colony algorithm for the cooperative maximum covering location problem. Int. J. Mach. Learn. Cybern. 8(2): 691-697 (2017) - [j35]Sachchida Nand Chaurasia, Shyam Sundar, Alok Singh:
Hybrid metaheuristic approaches for the single machine total stepwise tardiness problem with release dates. Oper. Res. 17(1): 275-295 (2017) - 2016
- [j34]Venkatesh Pandiri, Alok Singh:
Swarm intelligence approaches for multidepot salesmen problems with load balancing. Appl. Intell. 44(4): 849-861 (2016) - [j33]Jayalakshmi Banda, Alok Singh:
A swarm intelligence approach for the p-median problem. Int. J. Metaheuristics 5(2): 136-155 (2016) - [j32]Sachchida Nand Chaurasia, Alok Singh:
A hybrid heuristic for dominating tree problem. Soft Comput. 20(1): 377-397 (2016) - [j31]Abobakr Khalil Alshamiri, Alok Singh, Bapi Raju Surampudi:
Artificial bee colony algorithm for clustering: an extreme learning approach. Soft Comput. 20(8): 3163-3176 (2016) - [c23]Abobakr Khalil Alshamiri, Alok Singh, Bapi Raju Surampudi:
Comparative analysis of ELM and No-Prop algorithms. IC3 2016: 1-5 - 2015
- [j30]Sachchida Nand Chaurasia, Alok Singh:
A hybrid evolutionary algorithm with guided mutation for minimum weight dominating set. Appl. Intell. 43(3): 512-529 (2015) - [j29]Pandiri Venkatesh, Alok Singh:
Two metaheuristic approaches for the multiple traveling salesperson problem. Appl. Soft Comput. 26: 74-89 (2015) - [j28]Vuyyuru Gopinadh, Alok Singh:
Swarm intelligence approaches for cover scheduling problem in wireless sensor networks. Int. J. Bio Inspired Comput. 7(1): 50-61 (2015) - [j27]Sachchida Nand Chaurasia, Alok Singh:
A hybrid swarm intelligence approach to the registration area planning problem. Inf. Sci. 302: 50-69 (2015) - [j26]Shyam Sundar, Alok Singh:
Metaheuristic Approaches for the Blockmodel Problem. IEEE Syst. J. 9(4): 1237-1247 (2015) - [c22]Shyam Sundar, Sachchida Nand Chaurasia, Alok Singh:
An Ant Colony Optimization Approach for the Dominating Tree Problem. SEMCCO 2015: 143-153 - 2014
- [j25]Sachchida Nand Chaurasia, Alok Singh:
A hybrid evolutionary approach to the registration area planning problem. Appl. Intell. 41(4): 1127-1149 (2014) - [c21]Wilson Naik Bhukya, Alok Singh:
An effective heuristic for construction of all-to-all minimum power broadcast trees in wireless networks. ICACCI 2014: 74-79 - [c20]Jayalakshmi Banda, Alok Singh:
A Hybrid Artificial Bee Colony Algorithm for the Terminal Assignment Problem. SEMCCO 2014: 134-144 - [c19]Abobakr Khalil Alshamiri, Bapi Raju Surampudi, Alok Singh:
A Novel ELM K-Means Algorithm for Clustering. SEMCCO 2014: 212-222 - [c18]C. G. Nitash, Alok Singh:
An artificial bee colony algorithm for minimum weight dominating set. SIS 2014: 313-319 - 2013
- [j24]Alok Singh, André Rossi:
A genetic algorithm based exact approach for lifetime maximization of directional sensor networks. Ad Hoc Networks 11(3): 1006-1021 (2013) - [j23]Anupama Potluri, Alok Singh:
Hybrid metaheuristic algorithms for minimum weight dominating set. Appl. Soft Comput. 13(1): 76-88 (2013) - [j22]Shyam Sundar, Alok Singh:
New heuristic approaches for the dominating tree problem. Appl. Soft Comput. 13(12): 4695-4703 (2013) - [j21]André Rossi, Alok Singh, Marc Sevaux:
Lifetime maximization in wireless directional sensor network. Eur. J. Oper. Res. 231(1): 229-241 (2013) - [j20]Anupama Potluri, Alok Singh:
Metaheuristic algorithms for computing capacitated dominating set with uniform and variable capacities. Swarm Evol. Comput. 13: 22-33 (2013) - [c17]Wilson Naik Bhukya, Alok Singh:
A study on energy issues in construction of all-to-all minimum power broadcast (A2A MPB) trees in wireless networks. ICACCI 2013: 1496-1501 - [c16]V. Venkata Ramana Murthy, Alok Singh:
An Ant Colony Optimization Algorithm for the Min-Degree Constrained Minimum Spanning Tree Problem. SEMCCO (2) 2013: 85-94 - [c15]Lakshmi Kanth Munganda, Alok Singh:
Metaheuristic Approaches for Multiprocessor Scheduling. SocProS (1) 2013: 721-731 - 2012
- [j19]André Rossi, Alok Singh, Marc Sevaux:
An exact approach for maximizing the lifetime of sensor networks with adjustable sensing ranges. Comput. Oper. Res. 39(12): 3166-3176 (2012) - [j18]Shyam Sundar, Alok Singh, André Rossi:
New heuristics for two bounded-degree spanning tree problems. Inf. Sci. 195: 226-240 (2012) - [j17]Alok Singh, Jorge M. S. Valente, Maria do Rosário Alves Moreira:
Hybrid heuristics for the single machine scheduling problem with quadratic earliness and tardiness costs. Int. J. Mach. Learn. Cybern. 3(4): 327-333 (2012) - [j16]André Rossi, Alok Singh, Marc Sevaux:
Column generation algorithm for sensor coverage scheduling under bandwidth constraints. Networks 60(3): 141-154 (2012) - [j15]Shyam Sundar, Alok Singh:
A hybrid heuristic for the set covering problem. Oper. Res. 12(3): 345-365 (2012) - [j14]Shyam Sundar, Alok Singh:
A swarm intelligence approach to the early/tardy scheduling problem. Swarm Evol. Comput. 4: 25-32 (2012) - [c14]Manohar Pallantla, Alok Singh:
Grenade Explosion Method for Maximum Weight Clique Problem. IC3 2012: 20-27 - [c13]Anupama Potluri, Alok Singh:
A Greedy Heuristic and Its Variants for Minimum Capacitated Dominating Set. IC3 2012: 28-39 - 2011
- [j13]Marc Sevaux, Alok Singh, André Rossi:
Tabu Search for Multiprocessor Scheduling: Application to High Level Synthesis. Asia Pac. J. Oper. Res. 28(2): 201-212 (2011) - [j12]Alok Singh, Wilson Naik Bhukya:
A hybrid genetic algorithm for the minimum energy broadcast problem in wireless ad hoc networks. Appl. Soft Comput. 11(1): 667-674 (2011) - [j11]Alok Singh, Shyam Sundar:
An artificial bee colony algorithm for the minimum routing cost spanning tree problem. Soft Comput. 15(12): 2489-2499 (2011) - [c12]André Rossi, Marc Sevaux, Alok Singh, Martin Josef Geiger:
On the Cover Scheduling Problem in Wireless Sensor Networks. INOC 2011: 657-668 - [c11]Anupama Potluri, Alok Singh:
Two Hybrid Meta-heuristic Approaches for Minimum Dominating Set Problem. SEMCCO (2) 2011: 97-104 - [c10]Santhosh Peddi, Alok Singh:
Grouping Genetic Algorithm for Data Clustering. SEMCCO (1) 2011: 225-232 - 2010
- [j10]Alok Singh:
A Hybrid Permutation-Coded Evolutionary Algorithm for the Early/tardy Scheduling Problem. Asia Pac. J. Oper. Res. 27(6): 713-725 (2010) - [j9]André Rossi, Alok Singh, Marc Sevaux:
A metaheuristic for the fixed job scheduling problem under spread time constraints. Comput. Oper. Res. 37(6): 1045-1054 (2010) - [j8]Shyam Sundar, Alok Singh:
A swarm intelligence approach to the quadratic minimum spanning tree problem. Inf. Sci. 180(17): 3182-3191 (2010) - [c9]Shyam Sundar, Alok Singh, André Rossi:
An Artificial Bee Colony Algorithm for the 0-1 Multidimensional Knapsack Problem. IC3 (1) 2010: 141-151 - [c8]Shyam Sundar, Alok Singh:
A Swarm Intelligence Approach to the Quadratic Multiple Knapsack Problem. ICONIP (1) 2010: 626-633
2000 – 2009
- 2009
- [j7]Alok Singh:
An artificial bee colony algorithm for the leaf-constrained minimum spanning tree problem. Appl. Soft Comput. 9(2): 625-631 (2009) - [j6]Alok Singh, Anurag Singh Baghel:
A new grouping genetic algorithm approach to the multiple traveling salesperson problem. Soft Comput. 13(1): 95-101 (2009) - [c7]Alok Singh, Marc Sevaux, André Rossi:
A Hybrid Grouping Genetic Algorithm for Multiprocessor Scheduling. IC3 2009: 1-7 - [c6]Srikanth Pulikanti, Alok Singh:
An Artificial Bee Colony Algorithm for the Quadratic Knapsack Problem. ICONIP (2) 2009: 196-205 - 2008
- [j5]Alok Singh, Anurag Singh Baghel:
New Metaheuristic Approaches for the Leaf-Constrained Minimum Spanning Tree Problem. Asia Pac. J. Oper. Res. 25(4): 575-589 (2008) - [c5]Alok Singh:
A New Heuristic for the Minimum Routing Cost Spanning Tree Problem. ICIT 2008: 9-13 - 2007
- [j4]Alok Singh, Ashok Kumar Gupta:
Two heuristics for the one-dimensional bin-packing problem. OR Spectr. 29(4): 765-781 (2007) - [j3]Alok Singh, Ashok Kumar Gupta:
Improved heuristics for the bounded-diameter minimum spanning tree problem. Soft Comput. 11(10): 911-921 (2007) - [c4]Alok Singh, Anurag Singh Baghel:
A New Grouping Genetic Algorithm for the Quadratic Multiple Knapsack Problem. EvoCOP 2007: 210-218 - [c3]Alok Singh, Anurag Singh Baghel:
A Hybrid Evolutionary Approach to the Quadratic Knapsack Problem. IICAI 2007: 200-208 - [c2]Alok Singh, Ashok Kumar Gupta:
Perturbation Based Local Search for the Degree-Constrained Minimum Spanning-Tree Problem. IICAI 2007: 209-219 - 2006
- [j2]Alok Singh, Ashok Kumar Gupta:
A Hybrid Heuristic for the Minimum Weight Vertex Cover Problem. Asia Pac. J. Oper. Res. 23(2): 273-285 (2006) - [j1]Alok Singh, Ashok Kumar Gupta:
A hybrid heuristic for the maximum clique problem. J. Heuristics 12(1-2): 5-22 (2006) - 2005
- [c1]Alok Singh, Ashok Kumar Gupta:
Two New Heuristics for the Equal Piles Problem. IICAI 2005: 3408-3423
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:05 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
