default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCigdem Alabas-Uslu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j12]Ercan Emin Cihan
, Cigdem Alabas-Uslu, Özgür Kabak:
Initial preference algorithm of industrial project portfolio. Kybernetes 52(12): 6025-6048 (2023)- 2022
- [j11]Nilay Ozcelikkan, Gülfem Tuzkaya, Cigdem Alabas-Uslu, Bahar Sennaroglu:
A multi-objective agile project planning model and a comparative meta-heuristic approach. Inf. Softw. Technol. 151: 107023 (2022) - 2020
- [j10]Melike Öztürk, Cigdem Alabas-Uslu:
Cantor set based neighbor generation method for permutation solution representation. J. Intell. Fuzzy Syst. 39(5): 6157-6168 (2020) - 2019
- [j9]Cigdem Alabas-Uslu, Berna Dengiz, Canan Aglan, Ihsan Sabuncuoglu:
Modified self-adaptive local search algorithm for a biobjective permutation flow shop scheduling problem. Turkish J. Electr. Eng. Comput. Sci. 27(4): 2730-2745 (2019) - 2017
- [j8]Filiz Cetin, Cigdem Alabas-Uslu:
Heuristic solution to the product targeting problem based on mathematical programming. Int. J. Prod. Res. 55(1): 3-17 (2017) - 2015
- [j7]Berna Dengiz, Cigdem Alabas-Uslu:
A self-tuning heuristic for the design of communication networks. J. Oper. Res. Soc. 66(7): 1101-1114 (2015) - 2014
- [j6]Cigdem Alabas-Uslu, Berna Dengiz:
A Self-Adaptive Heuristic Algorithm for Combinatorial Optimization Problems. Int. J. Comput. Intell. Syst. 7(5): 827-852 (2014) - 2011
- [j5]Cigdem Alabas-Uslu, Berna Dengiz:
A self-adaptive local search algorithm for the classical vehicle routing problem. Expert Syst. Appl. 38(7): 8990-8998 (2011) - 2009
- [j4]Berna Dengiz, Cigdem Alabas-Uslu, Orhan Dengiz:
A tabu search algorithm for the training of neural networks. J. Oper. Res. Soc. 60(2): 282-291 (2009) - [j3]Berna Dengiz, Cigdem Alabas-Uslu, Orhan Dengiz:
Optimization of manufacturing systems using a neural network metamodel with a new training approach. J. Oper. Res. Soc. 60(9): 1191-1197 (2009) - 2008
- [j2]Cigdem Alabas-Uslu:
A self-tuning heuristic for a multi-objective vehicle routing problem. J. Oper. Res. Soc. 59(7): 988-996 (2008) - 2002
- [j1]Cigdem Alabas-Uslu, Fulya Altiparmak, Berna Dengiz:
A comparison of the performance of artificial intelligence techniques for optimizing the number of kanbans. J. Oper. Res. Soc. 53(8): 907-914 (2002)
Conference and Workshop Papers
- 2009
- [c3]Berna Dengiz, Cigdem Alabas-Uslu, Ihsan Sabuncuoglu:
A local search heuristic with self-tuning parameter for permutation flow-shop scheduling problem. CISched 2009: 62-67 - 2000
- [c2]Cigdem Alabas-Uslu, Fulya Altiparmak, Berna Dengiz:
The optimization of number of kanbans with genetic algorithms, simulated annealing and tabu search. CEC 2000: 580-585 - [c1]Berna Dengiz, Cigdem Alabas-Uslu:
Simulation optimization using tabu search. WSC 2000: 805-810
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-29 21:20 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:
