default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBanu Soylu
Person information
- affiliation: Erciyes University, Kayseri, Turkey
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j18]Banu Soylu
, Betül Yildirim:
A hub-and-spoke network design for relocating emergency service vehicles. Comput. Oper. Res. 174: 106898 (2025)- 2024
- [j17]Enver Engür, Banu Soylu:
A linear multivariate decision tree with branch-and-bound components. Neurocomputing 576: 127354 (2024) - [j16]Hatice Senozan, Banu Soylu:
A flexible non-monotonic discretization method for pre-processing in supervised learning. Pattern Recognit. Lett. 181: 77-85 (2024) - 2023
- [j15]Gazi Bilal Yildiz, Banu Soylu:
Integrating preventive and predictive maintenance policies with system dynamics: A decision table approach. Adv. Eng. Informatics 56: 101952 (2023) - [j14]Betül Yildirim, Banu Soylu:
Relocating emergency service vehicles with multiple coverage and critical levels partition. Comput. Ind. Eng. 177: 109016 (2023)
2010 – 2019
- 2019
- [j13]Banu Soylu, Hatice Katip:
A multiobjective hub-airport location problem for an airline network design. Eur. J. Oper. Res. 277(2): 412-425 (2019) - 2018
- [j12]Banu Soylu:
The search-and-remove algorithm for biobjective mixed-integer linear programming problems. Eur. J. Oper. Res. 268(1): 281-299 (2018) - 2017
- [j11]Lakmali Weerasena, Margaret M. Wiecek, Banu Soylu:
An algorithm for approximating the Pareto set of the multiobjective set covering problem. Ann. Oper. Res. 248(1-2): 493-514 (2017) - 2016
- [j10]Banu Soylu, Gazi Bilal Yildiz:
An exact algorithm for biobjective mixed integer linear programming problems. Comput. Oper. Res. 72: 204-213 (2016) - [j9]Pietro Belotti, Banu Soylu, Margaret M. Wiecek:
Fathoming rules for biobjective mixed integer linear programs: Review and extensions. Discret. Optim. 22: 341-363 (2016) - 2015
- [j8]Banu Soylu:
A general variable neighborhood search heuristic for multiple traveling salesmen problem. Comput. Ind. Eng. 90: 390-401 (2015) - [j7]Banu Soylu:
Heuristic approaches for biobjective mixed 0-1 integer linear programming problems. Eur. J. Oper. Res. 245(3): 690-703 (2015) - 2014
- [j6]Banu Soylu, Bahar Akyol:
Multi-criteria inventory classification with reference items. Comput. Ind. Eng. 69: 12-20 (2014) - 2011
- [j5]Banu Soylu:
A multi-criteria sorting procedure with Tchebycheff utility function. Comput. Oper. Res. 38(8): 1091-1102 (2011) - [j4]Banu Soylu, Selda Kapan Ulusoy:
A preference ordered classification for a multi-objective max-min redundancy allocation problem. Comput. Oper. Res. 38(12): 1855-1866 (2011) - 2010
- [j3]Banu Soylu:
Integrating Prometheeii with the Tchebycheff Function for Multi Criteria Decision Making. Int. J. Inf. Technol. Decis. Mak. 9(4): 525-545 (2010) - [j2]Murat Köksalan, Banu Soylu:
Bicriteria p-Hub Location Problems and Evolutionary Algorithms. INFORMS J. Comput. 22(4): 528-542 (2010) - [j1]Banu Soylu, Murat Köksalan:
A Favorable Weight-Based Evolutionary Algorithm for Multiple Criteria Problems. IEEE Trans. Evol. Comput. 14(2): 191-205 (2010)
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-12-23 19:32 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:
