default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGülsah Karakaya
Person information
- affiliation: Middle East Technical University, Ankara, Turkey
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j13]Gülsah Karakaya
, Murat Köksalan:
Finding preferred solutions under weighted Tchebycheff preference functions for multi-objective integer programs. Eur. J. Oper. Res. 308(1): 215-228 (2023)- [j12]Ali Özarslan, Gülsah Karakaya:
Interactive Approaches to Multiple Criteria Sorting Problems: Entropy-Based Question Selection Methods. Int. J. Inf. Technol. Decis. Mak. 22(1): 279-312 (2023) - 2021
- [j11]Gülsah Karakaya, Murat Köksalan:
Evaluating solutions and solution sets under multiple objectives. Eur. J. Oper. Res. 294(1): 16-28 (2021) - [j10]Gülsah Karakaya, Ceren Tuncer Sakar:
A New Interactive Algorithm for Continuous Multiple Criteria Problems: A Portfolio Optimization Example. Int. J. Inf. Technol. Decis. Mak. 20(1): 371-398 (2021) - [j9]Bogaç Can Yildirim, Gülsah Karakaya, Mustafa Sinan Gönül:
Fibonacci Series-Based Pairwise Comparison Scale for Analytic Hierarchy Process. Int. J. Inf. Technol. Decis. Mak. 20(3): 959-986 (2021) - [j8]Gülsah Karakaya, Murat Köksalan:
Interactive approaches for biobjective problems with progressively changing solution sets. Int. Trans. Oper. Res. 28(1): 356-375 (2021) - 2020
- [j7]Gülsah Karakaya, Murat Köksalan:
Estimating the form of a decision maker's preference function and converging towards preferred solutions. IISE Trans. 52(6): 651-664 (2020) - 2018
- [j6]Gülsah Karakaya, Murat Köksalan, Selin Damla Ahipasaoglu:
Interactive algorithms for a broad underlying family of preference functions. Eur. J. Oper. Res. 265(1): 248-262 (2018) - [j5]Müberra Özmen, Gülsah Karakaya, Murat Köksalan:
Interactive evolutionary approaches to multiobjective feature selection. Int. Trans. Oper. Res. 25(3): 1027-1052 (2018) - 2016
- [j4]Gülsah Karakaya, Murat Köksalan:
An interactive approach for Bi-attribute multi-item auctions. Ann. Oper. Res. 245(1-2): 97-119 (2016) - [j3]Gülsah Karakaya, Stefano Galelli, Selin Damla Ahipasaoglu, Riccardo Taormina:
Identifying (Quasi) Equally Informative Subsets in Feature Selection Problems for Classification: A Max-Relevance Min-Redundancy Approach. IEEE Trans. Cybern. 46(6): 1424-1437 (2016) - 2014
- [j2]Murat Köksalan, Gülsah Karakaya:
An Evolutionary Algorithm for Finding Efficient Solutions in Multi-Attribute Auctions. Int. J. Inf. Technol. Decis. Mak. 13(3): 649- (2014) - 2011
- [j1]Gülsah Karakaya, Murat Köksalan:
An interactive approach for multi-attribute auctions. Decis. Support Syst. 51(2): 299-306 (2011)
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 2025-01-09 12:51 CET 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:
