default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPrem Prakash Vuppuluri
Person information
- affiliation: Dayalbagh Educational Institute (Deemed University), Agra, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j6]Marcelo Rodrigues de Holanda Maia
, Miguel Reula, Consuelo Parreño-Torres, Prem Prakash Vuppuluri, Alexandre Plastino, Uéverton S. Souza, Sara Ceschia, Mario Pavone, Andrea Schaerf:
Metaheuristic techniques for the capacitated facility location problem with customer incompatibilities. Soft Comput. 27(8): 4685-4698 (2023)- 2021
- [j5]Prem Prakash Vuppuluri, Chellapilla Patvardhan:
Serial and parallel memetic algorithms for the bounded diameter minimum spanning tree problem. Expert Syst. J. Knowl. Eng. 38(2) (2021) - 2020
- [j4]Prem Prakash Vuppuluri, C. Patvardhan, Anand Srivastav:
A novel Hybrid Multi-objective Evolutionary Algorithm for the bi-Objective Minimum Diameter-Cost Spanning Tree (bi-MDCST) problem. Eng. Appl. Artif. Intell. 87 (2020) - [j3]Prem Prakash Vuppuluri, C. Patvardhan:
Novel Heuristics for the Euclidean Leaf-Constrained Minimum Spanning Tree Problem. SN Comput. Sci. 1(2): 111 (2020)
2010 – 2019
- 2015
- [j2]C. Patvardhan, Prem Prakash Vuppuluri, Anand Srivastav:
Fast Heuristics for Large Instances of the Euclidean Bounded Diameter Minimum Spanning Tree Problem. Informatica (Slovenia) 39(3) (2015) - 2012
- [j1]C. Patvardhan, Prem Prakash Vuppuluri, Anand Srivastav:
Novel quantum-inspired evolutionary algorithms for the quadratic knapsack problem. Int. J. Math. Oper. Res. 4(2): 114-127 (2012)
2000 – 2009
- 2009
- [c1]C. Patvardhan, Prem Prakash Vuppuluri:
Novel Deterministic Heuristics for Building Minimum Spanning Trees with Constrained Diameter. PReMI 2009: 68-73
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-04-24 23:09 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:
