![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Pandiri Venkatesh
Person information
- affiliation: University of Hyderabad, India
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
- [j10]Venkatesh Pandiri
, Alok Singh
:
Solution of the family traveling salesman problem using a hyper-heuristic approach. Eng. Appl. Artif. Intell. 133: 108193 (2024) - 2021
- [j9]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) - [j8]Kasi Viswanath Dasari
, Venkatesh Pandiri
, Alok Singh
:
Multi-start heuristics for the profitable tour problem. Swarm Evol. Comput. 64: 100897 (2021) - 2020
- [j7]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) - [j6]Venkatesh Pandiri, Alok Singh
, André Rossi:
Two hybrid metaheuristic approaches for the covering salesman problem. Neural Comput. Appl. 32(19): 15643-15663 (2020) - 2019
- [j5]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) - 2018
- [j4]Venkatesh Pandiri
, Alok Singh
:
A swarm intelligence approach for the colored traveling salesman problem. Appl. Intell. 48(11): 4412-4428 (2018) - [j3]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) - 2016
- [j2]Venkatesh Pandiri
, Alok Singh
:
Swarm intelligence approaches for multidepot salesmen problems with load balancing. Appl. Intell. 44(4): 849-861 (2016) - 2015
- [j1]Pandiri Venkatesh
, Alok Singh
:
Two metaheuristic approaches for the multiple traveling salesperson problem. Appl. Soft Comput. 26: 74-89 (2015)
Conference and Workshop Papers
- 2019
- [c1]Pandiri Venkatesh
, Alok Singh, Rammohan Mallipeddi:
A Multi-Start Iterated Local Search Algorithm for the Maximum Scatter Traveling Salesman Problem. CEC 2019: 1390-1397
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-06-03 01:03 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint