default search action
Kalyan Shankar Bhattacharjee
Person information
- affiliation: University of New South Wales, Sydney, New South Wales, Australia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [p1]Kalyan Shankar Bhattacharjee, Hemant Kumar Singh
, Tapabrata Ray:
Many-Objective Optimization with Limited Computing Budget. High-Performance Simulation-Based Optimization 2020: 17-46
2010 – 2019
- 2019
- [j4]Hemant Kumar Singh
Distance-Based Subset Selection for Benchmarking in Evolutionary Multi/Many-Objective Optimization. IEEE Trans. Evol. Comput. 23(5): 904-912 (2019) - [c9]Kalyan Shankar Bhattacharjee, Hemant Kumar Singh
Optimum Wind Farm Layouts: A Many-Objective Perspective and Case Study. EMO 2019: 707-718 - 2018
- [b1]Kalyan Shankar Bhattacharjee:
Development of efficient algorithms for computationally expensive optimization problems. University of New South Wales, Sydney, Australia, 2018 - [c8]Hemant Kumar Singh
Investigation of a Simple Distance Based Ranking Metric for Decomposition-Based Multi/Many-Objective Evolutionary Algorithms. Australasian Conference on Artificial Intelligence 2018: 384-396 - 2017
- [j3]Kalyan Shankar Bhattacharjee, Hemant Kumar Singh
An approach to generate comprehensive piecewise linear interpolation of pareto outcomes to aid decision making. J. Glob. Optim. 68(1): 71-93 (2017) - [j2]Jürgen Branke
Efficient Use of Partially Converged Simulations in Evolutionary Optimization. IEEE Trans. Evol. Comput. 21(1): 52-64 (2017) - [j1]Kalyan Shankar Bhattacharjee, Hemant Kumar Singh
Bridging the Gap: Many-Objective Optimization and Informed Decision-Making. IEEE Trans. Evol. Comput. 21(5): 813-820 (2017) - [c7]Kalyan Shankar Bhattacharjee, Hemant Kumar Singh
Enhanced Pareto Interpolation Method to Aid Decision Making for Discontinuous Pareto Optimal Fronts. Australasian Conference on Artificial Intelligence 2017: 93-105 - [c6]Kalyan Shankar Bhattacharjee, Hemant Kumar Singh
Decomposition Based Evolutionary Algorithm with a Dual Set of reference vectors. CEC 2017: 105-112 - 2016
- [c5]Kalyan Shankar Bhattacharjee, Hemant Kumar Singh
A Study on Performance Metrics to Identify Solutions of Interest from a Trade-Off Set. ACALCI 2016: 66-77 - [c4]Kalyan Shankar Bhattacharjee, Hemant Kumar Singh
Multiple surrogate assisted multiobjective optimization using improved pre-selection. CEC 2016: 4328-4335 - 2015
- [c3]Kalyan Shankar Bhattacharjee, Tapabrata Ray
An Evolutionary Algorithm with Classifier Guided Constraint Evaluation Strategy for Computationally Expensive Optimization Problems. Australasian Conference on Artificial Intelligence 2015: 49-62 - [c2]Kalyan Shankar Bhattacharjee, Tapabrata Ray
Cost to Evaluate Versus Cost to Learn? Performance of Selective Evaluation Strategies in Multiobjective Optimization. Australasian Conference on Artificial Intelligence 2015: 63-75 - [c1]Kalyan Shankar Bhattacharjee, Tapabrata Ray
Selective evaluation in multiobjective optimization: A less explored avenue. CEC 2015: 1893-1900
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-25 05:45 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: