![](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
Banu Lokman
Person information
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
2020 – today
- 2024
- [j13]Dilay Aktas
, Banu Lokman
, Tülin Inkaya
, Gilles Dejaegere:
Cluster ensemble selection and consensus clustering: A multi-objective optimization approach. Eur. J. Oper. Res. 314(3): 1065-1077 (2024) - 2023
- [j12]Gökhan Ceyhan
, Murat Köksalan
, Banu Lokman
:
Finding the Nondominated Set and Efficient Integer Vectors for a Class of Three-Objective Mixed-Integer Linear Programs. Manag. Sci. 69(10): 6001-6020 (2023) - 2022
- [j11]Ilgin Dogan
, Banu Lokman
, Murat Köksalan:
Representing the nondominated set in multi-objective mixed-integer programs. Eur. J. Oper. Res. 296(3): 804-818 (2022) - [j10]Nasim Nasrabadi, Akram Dehnokhalaji, Pekka Korhonen
, Banu Lokman
, Jyrki Wallenius:
Robustness of efficiency scores in data envelopment analysis with interval scale data. Eur. J. Oper. Res. 297(3): 1151-1161 (2022) - [j9]Gökhan Ceyhan, Murat Köksalan, Banu Lokman
:
Extensions for Benders cuts and new valid inequalities for solving the European day-ahead electricity market clearing problem efficiently. Eur. J. Oper. Res. 300(2): 713-726 (2022) - 2021
- [j8]Banu Lokman
:
Optimizing a linear function over the nondominated set of multiobjective integer programs. Int. Trans. Oper. Res. 28(4): 2248-2267 (2021) - 2020
- [j7]Sami Serkan Özarik
, Banu Lokman
, Murat Köksalan:
Distribution based representative sets for multi-objective integer programs. Eur. J. Oper. Res. 284(2): 632-643 (2020)
2010 – 2019
- 2019
- [j6]Banu Lokman
, Murat Köksalan
:
Identifying preferred solutions in multiobjective combinatorial optimizationproblems. Turkish J. Electr. Eng. Comput. Sci. 27(3): 1970-1981 (2019) - [j5]Gökhan Ceyhan
, Murat Köksalan, Banu Lokman
:
Finding a representative nondominated set for multi-objective mixed integer programs. Eur. J. Oper. Res. 272(1): 61-77 (2019) - 2018
- [j4]Banu Lokman
, Murat Köksalan, Pekka J. Korhonen
, Jyrki Wallenius:
An interactive approximation algorithm for multi-objective integer programs. Comput. Oper. Res. 96: 80-90 (2018) - 2016
- [j3]Banu Lokman
, Murat Köksalan, Pekka J. Korhonen, Jyrki Wallenius:
An interactive algorithm to find the most preferred solution of multi-objective integer programs. Ann. Oper. Res. 245(1-2): 67-95 (2016) - 2015
- [j2]Murat Köksalan, Banu Lokman
:
Finding nadir points in multi-objective integer programs. J. Glob. Optim. 62(1): 55-77 (2015) - 2013
- [j1]Banu Lokman, Murat Köksalan:
Finding all nondominated points of multi-objective integer programs. J. Glob. Optim. 57(2): 347-365 (2013)
Coauthor Index
![](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-08-05 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint